-
Notifications
You must be signed in to change notification settings - Fork 0
/
Solution.java
38 lines (37 loc) · 1.15 KB
/
Solution.java
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
package String.easy.No_28_Implement_strStr;
/**
* FileName: Solution
* Author: EdisonLi的家用MacBook Pro
* Date: 2019-05-18 21:04
* Description:
* Implement strStr().
* <p>
* Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.
* <p>
* Example 1:
* <p>
* Input: haystack = "hello", needle = "ll"
* Output: 2
* Example 2:
* <p>
* Input: haystack = "aaaaa", needle = "bba"
* Output: -1
* Clarification:
* <p>
* What should we return when needle is an empty string? This is a great question to ask during an interview.
* <p>
* 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().
*/
public class Solution {
//双指针
public int strStr(String haystack, String needle) {
for (int i = 0; ; i++) {
for (int j = 0; ; j++) {
if (j == needle.length()) return i;
if (j + i == haystack.length()) return -1;
//游走的不相等与最新的
if (needle.charAt(j) != haystack.charAt(i + j))break;
}
}
}
}