-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path028_Implement_strStr().java
More file actions
38 lines (36 loc) · 926 Bytes
/
028_Implement_strStr().java
File metadata and controls
38 lines (36 loc) · 926 Bytes
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
// Implement strStr().
//
// Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.
//
// Example 1:
//
//
// Input: haystack = "hello", needle = "ll"
// Output: 2
//
//
// Example 2:
//
//
// Input: haystack = "aaaaa", needle = "bba"
// Output: -1
//
//
// Clarification:
//
// What should we return when needle is an empty string? This is a great question to ask during an interview.
//
// For the purpose of this problem, we will return 0 when needle is an empty string. This is consistent to C's strstr() and Java's indexOf().
//
class Solution {
public int strStr(String haystack, String needle) {
int res = -1;
for(int i = 0; i <= haystack.length()-needle.length(); i ++){
if(haystack.substring(i, i+needle.length()).equals(needle)){
res = i;
break;
}
}
return res;
}
}