LeetCode 30. Substring with Concatenation of All Words

最新推荐文章于 2020-05-30 14:27:40 发布

转载最新推荐文章于 2020-05-30 14:27:40 发布 · 251 阅读

标签

#LeetCode 30. Substring with Co

LeetCode练习题专栏收录该内容

168 篇文章

订阅专栏

博客围绕LeetCode 30. Substring with Concatenation of All Words展开，提到该题思路与LeetCode 567. Permutation in String很像，强调要牢记滑动窗口思路，解法转载自相关博客。

LeetCode 30. Substring with Concatenation of All Words

Solution1：
转载自：http://www.cnblogs.com/grandyang/p/4521224.html，这道题的思路和LeetCode 567. Permutation in String非常像。滑动窗口的思路要牢记啊！！

class Solution {
public:
    vector<int> findSubstring(string s, vector<string>& words) {
        vector<int> res;
        if (s.empty() || words.empty()) return res;
        int n = words.size(), m = words[0].size();
        unordered_map<string, int> m1;
        for (auto &a : words) ++m1[a];
        for (int i = 0; i <= (int)s.size() - n * m; ++i) {
            unordered_map<string, int> m2;
            int j = 0; 
            for (j = 0; j < n; ++j) {
                string t = s.substr(i + j * m, m);
                //不能少也不能多，这两步处理的特别好~~~
                if (m1.find(t) == m1.end()) break;
                ++m2[t];
                if (m2[t] > m1[t]) break;
            }
            if (j == n) res.push_back(i);
        }
        return res;
    }
};