Sundy算法 C++实现

class Solution3
{
public:
    int getIndexOf(string str,string match)
    {
        if(str.size()<1 || match.size()<1 || str.size()<match.size()) return -1;
        int R=match.size();
        int pos=0;
        for(int i=0;i<str.size();)
        {
            if(str[i]!=match[pos])
            {

                int k=match.size()-1;
                while(k>0 && str[R]!=match[k])
                {
                    k--;
                }
                i=R-k;
                pos=0;
                R=i+match.size();
            }else
            {
                if(pos==match.size()-1)
                {
                    return i-pos;
                }
                pos++;
                i++;
            }
        }
        return -1;
    }
};

int main()
{
    string str = "abcabcababaccc";
    string match = "ababa";
    Solution3 ss;
    cout<<ss.getIndexOf(str,match)<<endl;

    return 0;
}