思路
1:朴素模式匹配
2:kmp(先欠着)
代码
class Solution {
public:
int strStr(string haystack, string needle) {
int h=haystack.size();
int n=needle.size();
for(int i=0;i<=h-n;++i){
int j=i;
int k=0;
while(k<n && haystack[j++]==needle[k++])
if(k==n)return i;
}
return -1;
}
};