28. 找出字符串中第一个匹配项的下标

28. 找出字符串中第一个匹配项的下标

class Solution {
public:
    vector<int>  get_num(string s)
    {
        vector<int> a(s.length());
        int j = 0;
        a[0] = 0;
        for(int i = 1 ; i < s.length() ; i++)
        {
            while(s[i] != s[j] && j > 0)
            {
                j = a[j - 1];
            }
            if( s[i] == s[j])
            {
                j ++;
                a[i] = j;
            }
        }
        return a;
    }
    int strStr(string haystack, string needle) 
    {
        vector<int> a = get_num(needle);
        int j = 0;
        for( int i = 0 ; i < haystack.length() ;i++)
        {
            while(haystack[i] != needle[j] && j > 0)
            {
                j = a [j - 1];
            }
            if(haystack[i] == needle[j] && j < needle.length())
            {
                j++;
            }
            if(j == needle.length() && haystack[i] == needle[j - 1] )
            {
                return (i - needle.length() + 1);
            }
        }
        return -1;
    }
};

本题的要点就是：要么在模式串找到匹配的字符并继续，要么从头开始遍历模式字符串。

459. 重复的子字符串

class Solution {
public:
    vector <int> get_num(string s)
    {
        vector<int> a(s.size());
        int j = 0;
        a[0] = 0;
        for(int i = 1; i < s.size() ; i++)
        {
            while(s[i] != s[j] && j > 0 )
            {
                j = a[j - 1];
            }
            if(s[i] == s[j])
            {
                j++;
                a[i] = j;
            }
        }
        return a;
    }
    bool repeatedSubstringPattern(string s) {
        vector <int> a(s.size());
        a = get_num(s);
        int len = s.size();
        if(len != 0 && a[len -1] != 0 && len % (len - a[len -1]) == 0 )
        return 1;
        return 0;
    }
};

写出前缀表会简单很多