-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFindTheIndexOfTheFirstOccurrenceInAString.java
More file actions
64 lines (43 loc) · 1.52 KB
/
FindTheIndexOfTheFirstOccurrenceInAString.java
File metadata and controls
64 lines (43 loc) · 1.52 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
package com.erikaax.algoritmsleetcode;
/**
*
* @author Erika AX
*/
/*
PROBLEM:
Given two strings needle and haystack, return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.
Example 1:
Input: haystack = "sadbutsad", needle = "sad"
Output: 0
Explanation: "sad" occurs at index 0 and 6.
The first occurrence is at index 0, so we return 0.
Example 2:
Input: haystack = "leetcode", needle = "leeto"
Output: -1
Explanation: "leeto" did not occur in "leetcode", so we return -1.
*/
public class FindTheIndexOfTheFirstOccurrenceInAString {
public static void main(String[] args) {
String haystack = "abc";
String needle = "c";
int response = -1;
if(haystack.contains(needle)) {
if(haystack.length() == 1) {
System.out.println(0);
return;
}
for (int i = 0; i < haystack.toCharArray().length; i++) {
if (i + needle.length() > haystack.toCharArray().length)
break;
String currentString = haystack.substring(i, i + needle.length());
if (currentString.contains(needle)) {
response = i;
System.out.println(response);
break;
}
}
}
else
System.out.println(response);
}
}