1. 程式人生 > >LeetCode Day24 implement-strstr

LeetCode Day24 implement-strstr

class Solution {
public:
    int strStr(string haystack, string needle) {
        if(!needle.size())return 0;
        int m = haystack.size(), n = needle.size();
        if (m < n) return -1;
        for(int i=0;i<=m-n;i++){
            int j=0;
            for(j=0;j<n;j++){
                if
(haystack[i+j]!=needle[j]) break; } //printf("%d",nn); if(j==n) return i; } return -1; } };

KMP演算法
參考從頭到尾徹底理解KMP