KMP算法:
aabaabaaf
012345
aabaaf
010120 找与其相等的前缀后面开始匹配, 2表示相等前后缀的长度
for循环文本串,再用patten去匹配 O(mn)
前缀表
prefix
next
aabaaf
010120
void getNext(next, s) {
j = 0
next[0]
for (i = 1; i < s.size(); i++)
while (j > 0 && s[i] != s[j])
j = next[j - 1]
if (s[i] == s[j]
next[i] = j;
初始化
处理前后缀不相同的情况
处理前后缀相同的情况
最后更新next
i 后缀末尾
j前缀末尾,还代表了i之前包括i最长相等子缀长度
28. 实现 strStr() - LeetCode
class Solution {
public int strStr(String haystack, String needle) {
if (needle.length() == 0) return 0;
int[] next = new int[needle.length()];
getNext(next, needle);
int j = 0;
for (int i = 0; i < haystack.length(); i++) {
while (j > 0 && needle.charAt(j) != haystack.charAt(i)){
j = next[j - 1];
}
if (needle.charAt(j) == haystack.charAt(i)){
j++;
}
if (j == needle.length()) {
return i - needle.length() + 1;
}
}
return -1;
}
private void getNext(int[] next, String s) {
int j = 0;
next[0] = 0;
for (int i = 1; i < s.length();i++) {
while (j > 0 && s.charAt(j) != s.charAt(i)) {
j = next[j - 1];
}
if (s.charAt(j) == s.charAt(i)) {
j++;
}
next[i] = j;
}
}
}
459.重复的子字符串- LeetCode
暴力解法: n^2
移动匹配:没听懂
KMP:前缀不包含尾字母,后缀:不包含首字母
class Solution {
public boolean repeatedSubstringPattern(String s) {
if (s.equals("")) return false;
int len = s.length();
s = " " + s;
char[] chars = s.toCharArray();
int[] next = new int[len + 1];
for (int i = 2, j = 0; i <= len; i++) {
while (j > 0 && chars[i] != chars[j + 1]) {
j = next[j];
}
if (chars[i] == chars[j + 1]) {
j++;
}
next[i] = j;
}
if (next[len] > 0 && len % (len - next[len]) == 0) return true;
return false;
}
}