对于一个给定的 source 字符串和一个 target 字符串,你应该在 source 字符串中找出 target 字符串出现的第一个位置(从0开始)。如果不存在,则返回 -1。
样例
如果 source = “source” 和 target = “target”,返回 -1。
如果 source = “abcdabcdefg” 和 target = “bcd”,返回 1。
挑战
O(n2)的算法是可以接受的。如果你能用O(n)的算法做出来那更加好。(提示:KMP)
解题思路:直接遍历source判断子字符串和target是否相等,但是这样的时间复杂度不是O(n),所以还是用kmp吧
class Solution {
/**
* Returns a index to the first occurrence of target in source,
* or -1 if target is not part of source.
* @param source string to be scanned.
* @param target string containing the sequence of characters to match.
*/
public int strStr(String source, String target) {
if(source == null || target == null) return -1;
int len = target.length();
for(int i = 0; i <= source.length() - len; i++){
if(source.substring(i, i + len).equals(target)){
return i;
}
}
return -1;
}
}
kmp一直没看懂,直到在b站上找到一个教学才明白。直接用教学的模版吧。
class Solution {
/**
* Returns a index to the first occurrence of target in source,
* or -1 if target is not part of source.
* @param source string to be scanned.
* @param target string containing the sequence of characters to match.
*/
public int strStr(String source, String target) {
if(source == null || target == null) return -1;
int[] lps = nextarray(target.toCharArray());
int i = 0;
int j = 0;
while(i < source.length() && j < target.length()){
if(source.charAt(i) == target.charAt(j)){
i++;
j++;
}else{
if(j != 0){
j = lps[j-1];
}else{
i++;
}
}
}
if(j == target.length()){
return (i - j);
}
return -1;
}
public static int[] nextarray(char[] pattern){
int[] lps = new int[pattern.length];
int index = 0;
for(int i = 1; i < pattern.length; i++){
if(pattern[i] == pattern[index]){
lps[i] = index + 1;
index++;
i++;
}else{
if(index != 0){
index = lps[index - 1];
}else{
lps[i] = 0;
i++;
}
}
}
return lps;
}
}