[LeetCode] Substring with Concatenation of All Words

class Solution {
    map<string, int> m_map;
    public:
        void initMap(vector<string> &L)
        {
            m_map.clear();
            for(size_t i = 0; i <L.size() ; i++)
            {
                if(m_map.find(L[i]) == m_map.end())
                    m_map[L[i]] = 1;
                else
                    m_map [L[i]]++;
            }
        }

        void printMap()
        {
            map<string,int>::iterator it;
            for(it = m_map.begin(); it != m_map.end(); it++)
            {
                cout << it->first << "\t-->\t" << it->second << endl;
            }
            cout << endl;
        }

        vector<int> findSubstring(string S, vector<string> &L)
        {
            vector<int> result;
            if(L.size() == 0)
                return result;

            size_t wordLen = L[0].size();
            size_t wordNum = L.size();
            size_t wordsLen = wordLen * wordNum;

            if(S.size() < wordsLen)
                return result;

            //cout << "wordLen \t" << wordLen << endl;
            //cout << "wordNum \t" << wordNum<< endl;
            //cout << "wordsLen\t" << wordsLen << endl;

            initMap(L);
            //printMap();

            for(size_t i = 0; i <= S.size() - wordsLen; i++)
            {
                size_t j = i;
                for( /**/; j < (i + wordsLen); j += wordLen)
                {
                    //cout << "j\t" << j << endl;
                    //printMap();
                    string tmp = S.substr(j, wordLen);
                    if(m_map.find(tmp) != m_map.end() && m_map[tmp] > 0)
                    {
                        m_map[tmp]--;
                    }
                    else
                    {
                        break;
                    }
                }
                //cout << "==j\t" << j << endl;
                if(j >= (i+wordsLen))
                {
                    result.push_back(i);
                }
                initMap(L);
            }
            return result;

        }
};