LeetCode: Substring with Concatenation of All Words

原创于 2012-11-05 14:21:14 发布 · 1.7k 阅读

0 ·

CC 4.0 BY-SA版权

算法同时被 2 个专栏收录

109 篇文章

订阅专栏

C++

108 篇文章

订阅专栏

本文介绍了一种高效的字符串匹配算法，该算法能在给定的字符串中找到由多个指定长度相同的单词组成的子串的所有起始位置。通过使用哈希表来存储目标单词及其出现次数，算法能够快速检查子串是否符合要求。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

You are given a string, S, and a list of words, L, that are all of the same length. Find all starting indices of substring(s) in S that is a concatenation of each word in L exactly once and without any intervening characters.

For example, given:
S: "barfoothefoobarman"
L: ["foo", "bar"]

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

class Solution {
public:
    vector<int> findSubstring(string S, vector<string> &L) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        map<string, int> words;
        map<string, int> count;
        vector<int> result;
        int wordNum = L.size();
        if (wordNum == 0) return result;
        for (int i = 0; i < wordNum; ++i)
            ++words[L[i]];
        
        int wordSize = L[0].size();
        int slength = S.size();
        for (int i = 0; i <= slength - wordSize*wordNum; ++i)
        {
            count.clear();
            int j = 0;
            for (; j < wordNum; ++j)
            {
                string w = S.substr(i+j*wordSize, wordSize); 
                if(words.find(w) == words.end())  
                    break;  
                ++count[w];  
                if(count[w] > words[w])  
                    break;  
            }
            if (j == wordNum) result.push_back(i);
        }
        return result;
    }
};