Leetcode Substring with concatenation of all words

最新推荐文章于 2019-12-26 08:25:23 发布

proudmore

最新推荐文章于 2019-12-26 08:25:23 发布

阅读量150

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/proudmore/article/details/44586949

版权

leetcode 专栏收录该内容

146 篇文章 0 订阅

订阅专栏

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

[code]

public class Solution {
    public List<Integer> findSubstring(String s, String[] L) {
        list=new ArrayList<Integer>();
        if(s==null || s.length()==0 || L==null || L.length==0)return list;

        HashMap<String, Integer> map=new HashMap<String, Integer>();
        for(String ss: L)
        {
            if(map.containsKey(ss))map.put(ss, map.get(ss)+1);
            else map.put(ss, 1);
        }
        len=L.length*L[0].length();
        n=L[0].length();

        int  index=0;
        while(index+len<=s.length())
        {
            HashMap<String, Integer> temp=new HashMap<String, Integer>(map);
            int i=0;
            while(map.size()>0)
            {
                String e=s.substring(index+i*n,index+(i+1)*n);
                if(map.containsKey(e))
                {
                    if(map.get(e)==1)map.remove(e);
                    else map.put(e, map.get(e)-1);
                }
                else break;
                i++;
            }
            if(map.size()==0)list.add(index);
            map=temp;
            index++;
        }
        return list;
    }
    List<Integer> list;
    int len;
    int n;
}