leetcode 30 Substring with Concatenation of All Words

最新推荐文章于 2026-06-22 21:02:26 发布

转载最新推荐文章于 2026-06-22 21:02:26 发布 · 152 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

原文链接：http://www.cnblogs.com/GadyPu/p/5598980.html

标签

#数据结构与算法

本文介绍了一个LeetCode上的编程挑战，题目为“子字符串拼接所有单词”。任务是在给定的字符串中找到所有可能的起始索引，这些索引对应的子串能够通过给定单词列表中的单词拼接而成，且每个单词恰好使用一次，中间无额外字符。文章提供了一种直接模拟的解决方案，尽管效率不高。

题目连接

https://leetcode.com/problems/substring-with-concatenation-of-all-words/

Substring with Concatenation of All Words

Description

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 wordsexactly once and without any intervening characters.

For example, given:
s: "barfoothefoobarman"
words: ["foo", "bar"]

You should return the indices: [0,9].
(order does not matter).

根据题意直接模拟(写的很挫跑的很慢QAQ)

class Solution {
public:
    vector<int> findSubstring(string s, vector<string>& words) {
        vector<int> res;
        if(s.empty() || words.empty()) return res;
        for(auto &r: words) A[r]++;
        int n = words[0].size(), m = s.size(), k = words.size();
        int len = m - n * k + 1;
        for(int i = 0; i < len; i++) {
            int d = k, j = i;
            B.clear();
            while(d) {
                string temp = s.substr(j, n);
                j += n;
                if(A.find(temp) == A.end()) {
                    break;
                } else {
                    B[temp]++;
                    if(B[temp] > A[temp]) break;
                    d--;
                }
            }
            if(!d) res.push_back(i);
        }
        return res;
    }
private:
    map<string, int> A, B;
};

转载于:https://www.cnblogs.com/GadyPu/p/5598980.html