力扣 题目30-- 串联所有单词的子串

题目

---

题解

---

暴力解法(思路来自评论区的老哥)

 

这里应该将题目中给的vector改为unordered_map容器然后去查找才能比较快捷

代码

---

#include<iostream>
#include<vector>
#include<string>
#include<unordered_map>
using namespace std;
class Solution {
public:
    vector<int> findSubstring(string s, vector<string>& words) {
        vector<int> result;
        int len = words[0].size();
        int wordsize = len * words.size();
        int superposition = 0;
        while (wordsize <= s.size()) {
            unordered_map<string, int> mp, tmp;
            for (auto str : words) {
                ++mp[str];
            }
        for (int i = 0; i < wordsize;) {
            string &&str = s.substr(i, len);
            if (mp.find(str) == mp.end()) break;
            ++tmp[str];
            i = i + len;
        }
        if (tmp == mp) result.push_back(superposition);
        tmp.clear();
        s=s.substr(1, s.size() - 1);
        superposition = superposition + 1;
        }
        return result;
    }
};
int main() {
    string s = "wordgoodgoodgoodbestword";
    vector<string> words = { "word","good","best","good" };
    Solution sol;
    vector<int> result=sol.findSubstring(s,words);
    for (int i = 0; i < result.size(); i++) {
        cout << result[i] << endl;
    }
}