代码随想录训练营 Day 09:LeetCode 28 、 459
28. 找出字符串中第一个匹配项的下标
题目
code
class Solution {
public:
void getnext(int * next, const string & s){
int j = -1;
next[0] = j;
for(int i = 1; i < s.size(); i++){
while(j >= 0 && s[i] != s[j + 1])
j = next[j];
if(s[j + 1] == s[i])
j++;
next[i] = j;
}
}
int strStr(string haystack, string needle) {
// 空子串,返回0
if(needle.size() == 0)
return 0;
// 计算子串的next数组
int next[needle.size()];
getnext(next, needle);
// 匹配
int i, j = -1;
for(i = 0; i < haystack.size(); i++)
{
while (j >= 0 && haystack[i] != needle[j + 1])
j = next[j];
if(haystack[i] == needle[j + 1])
j++;
if(j == needle.size() - 1){
return i - j;
}
}
return -1;
}
};
459. 重复的子字符串
题目
code
class Solution {
public:
void getnext(int * next, const string &s){
int j = -1;
next[0] = j;
for(int i = 1; i < s.size(); i++){
while(j >= 0 && s[j + 1] != s[i]){
j = next[j];
}
if(s[i] == s[j + 1])
j++;
next[i] = j;
}
}
bool repeatedSubstringPattern(string s) {
int len = s.size();
if(len == 1)
return false;
int next[len];
getnext(next, s);
if(next[len - 1] != -1 && (len % (len - (1 + next[len - 1]))) == 0)
return true;
return false;
}
};
总结
KMP算法,不是很好理解