【LeetCode】Substring with Concatenation of All Words

最新推荐文章于 2021-01-05 17:33:28 发布

Snowwolf_Yang

最新推荐文章于 2021-01-05 17:33:28 发布

阅读量571

点赞数

分类专栏：字符串 LeetCode

本文链接：https://blog.csdn.net/snowwolf_yang/article/details/26621337

版权

LeetCode 同时被 2 个专栏收录

86 篇文章 0 订阅

订阅专栏

字符串

11 篇文章 0 订阅

订阅专栏

参考链接

http://www.cnblogs.com/Rosanna/p/3444156.html

http://www.cnblogs.com/panda_lin/archive/2013/10/30/substring_with_concatenation_of_all_words.html

http://blog.csdn.net/doc_sgl/article/details/13022131

http://www.cnblogs.com/tgkx1054/p/3157562.html

题目描述

Substring with Concatenation of All Words

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).

题目分析

L里每个单词长度一样，写循环就方便了很多。先初始化一个map，统计L里每个单词出现的次数。每次循环如果某个单词没出现或者超出L中出现的错误就中断。

总结

代码示例

class Solution {
public:
    vector<int> findSubstring(string S, vector<string> &L) {
        vector<int> res;
        map<string,int> words;
        map<string,int> visited;
        map<string,int>::iterator iter1,iter2;
        int i,j;
        int len=L[0].size();
        if(S.size()<L.size()*len) return res;
        for(i=0;i<L.size();i++) words[L[i]]++;
        for(i=0;i<=S.size()-L.size()*len;i++)
        {
            visited.clear();
            for(j=i;j<=S.size()-len;j=j+len)
            {
                string temp=S.substr(j,len);
                iter1=words.find(temp);
                iter2=visited.find(temp);
                if(iter1==words.end()) break;
                if(iter1->second<=iter2->second) break;
                visited[temp]++;
            }
            if(words==visited) res.push_back(i);
        }
        return res;
    }
};