LeetCode 30. Substring with Concatenation of All Words C++(Hash Table)

You are given a string, s, and a list of words, words, that are all of the same length. Find all starting indices of substring(s) in s that is a concatenation of each word in words exactly once and without any intervening characters.
给定一个字符串 s 和一些长度相同的单词 words。找出 s 中恰好可以由 words 中所有单词串联形成的子串的起始位置。

注意子串要与 words 中的单词完全匹配，中间不能有其他字符，但不需要考虑 words 中单词串联的顺序。

Example 1:

Input:
  s = "barfoothefoobarman",
  words = ["foo","bar"]
Output: [0,9]
Explanation: Substrings starting at index 0 and 9 are "barfoo" and "foobar" respectively.
The output order does not matter, returning [9,0] is fine too.

Example 2:

Input:
  s = "wordgoodgoodgoodbestword",
  words = ["word","good","best","word"]
Output: []

C++ (BF)

class Solution {
public:
    vector<int> findSubstring(string s, vector<string>& words) {
    	map <string, int > Hash;
    	vector <int> res;
        if(words.empty() || s=="") return res;
    	for(auto x : words){
    		Hash[x]++;
		}
		int len = words[0].size();
		int total = len * words.size();// total = 6 
		for(int i = 0; i < s.length() - total + 1; i++){
            map <string, int > Hash2;
            int j;
			for( j = i; j < i +  total   ; j+=len ){
				string t = s.substr(j,len);
				Hash2[t]++;
				if(Hash2[t] > Hash[t] ) break; 
			}
			if(j == i + total  ){
				res.push_back(i);
			}
		}
        return res;
    }
};

第一版的代码超时，后来通过剪枝，600ms勉强AC
参考: 详细通俗的思路分析，多解法