leetcode--substring-with-concatenation-of-all-words---字符串

You are given a string, S, and a list of words, L, that are all of the same length. Find all starting indices of substring(s) in S that is a concatenation of each word in L exactly once and without any intervening characters.
For example, given:
S:”barfoothefoobarman”
L:[“foo”, “bar”]
You should return the indices:[0,9].
(order does not matter).

class Solution {
public:
    vector<int> findSubstring(string S, vector<string> &L) 
    {
        int cnt = L.size();
        int n = S.size();
        vector<int> ans;
        if(L.size() <= 0 || S.size() <= 0)
            return ans;

        map<string, int> m1;
        for(int i=0; i<L.size(); i++)
            ++m1[L[i]];

        int len = L[0].size();
        for(int i=0; i<len; i++)
        {
            map<string, int> m2;
            int count = 0;
            int left = i;
            for(int j=i; j<=n-len; j+=len)
            {
                string sub = S.substr(j, len);
                if(m1.count(sub))
                {
                    ++m2[sub];

                    if(m2[sub] <= m1[sub])
                    {
                        ++count;
                    }
                    else
                    {
                        while(m2[sub] > m1[sub])
                        {
                            string sub1 = S.substr(left, len);
                            left += len;
                            --m2[sub1];
                            if(m2[sub1] < m1[sub1])
                                --count;
                        }
                    }

                    if(count == cnt)
                    {
                        ans.push_back(left);
                        --m2[S.substr(left, len)];
                        --count;
                        left += len;
                    }
                }
                else
                {
                    left = j + len;
                    m2.clear();
                    count = 0;
                }
            }
        }

        sort(ans.begin(), ans.end());
        return ans;
    }
};

参考
https://www.cnblogs.com/grandyang/p/4521224.html