看到这道题就想到KMP算法,解法如下:
class Solution {
public:
int strStr(string haystack, string needle) {
if(needle.size()==0)
return 0;
if(haystack.size()==0)
return -1;
vector<int> next(needle.size());
Next(needle,next);
int i=0,j=0;
while