题目描述:
Implement strStr().
Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.
题目分析:
在一个字符串中查找另一个字符串,如果查找成功返回字符串头索引,否则返回-1。有两种求解方法:
(1) 暴力求解brute force。时间复杂度O(N^2)
(2)经典的KMP算法
题目求解一:
暴力求解
class Solution {
public:
int strStr(string haystack, string needle) {
int hlen = haystack.length();
int nlen = needle.length();
if (hlen < nlen)
return -1;
for(int i = 0; i < hlen - nlen + 1; i++){
int j = 0;
for(; j < nlen; j++){
if(haystack[i + j] != needle[j])
break;
}
if(j == nlen) return i;
}
return -1;
}
};
问题求解二:
KMP算法...