第35题 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).

Hide Tags

  Hash Table Two Pointers String

Solution in Java1:

public class Solution {
    public List<Integer> findSubstring(String S, String[] L) {
        List<Integer> result = new ArrayList<Integer>();
        if(S.length()==0||L.length==0)  return result;
        int wordLength = L[0].length();
        int totalLength = wordLength*L.length;
        if(totalLength<wordLength)  return result;
        
        //build the hashtable for all the words in L
        //Notice that the same word may appear in L for more than one times
        Map<String, Integer> wordMap = new HashMap<String, Integer>();
        for(int i=0; i<L.length; i++){
            if(wordMap.containsKey(L[i])){
                int duplicateTimes = wordMap.get(L[i]);
                wordMap.put(L[i], duplicateTimes+1);
            }else{
                wordMap.put(L[i],1);
            }
        }
        
        //from the start of S, check if the substring of length wordLength is in wordMap
        for(int i=0; i<=S.length()-totalLength; i++){
            String curWord = S.substring(i, i+wordLength);
            if(wordMap.containsKey(curWord)){   
                //wordMap contains curWord, start to check other words
                String  curStr = S.substring(i, i+totalLength);
                if(valid(curStr, wordMap, wordLength)){
                    result.add(i);
                }
            }
        }
        return result;
    }
    
    public boolean valid(String str, Map<String, Integer> map, int wordLength){
        int index=0; 
        Map<String, Integer> curMap = new HashMap<String, Integer>();
        curMap.putAll(map);
        while(index+wordLength<=str.length()){
            String curStr = str.substring(index, index+wordLength);
            index+=wordLength;
            if(!curMap.containsKey(curStr))    return false;
            else{
                int duplicates = curMap.get(curStr);
                if(duplicates==0) return false;
                else{
                    curMap.put(curStr, duplicates-1);
                }
            }
        }
        return true;
        
    }
}

Note:

map.putAll(map1)函数将map1的所有key－value对添加到map。对可能满足条件的substring，将其分割为wordLength的子字符串，逐一检查在不在map中，并查看出现的次数。对map的副本curMap，每有一个key值出现，就将其对应value，即这个key值出现次数减1。若key值减到0后还有该key值出现，说明不符合要求。

Solution in Java 2:

public class Solution {
    public List<Integer> findSubstring(String S, String[] L) {
        List<Integer> result = new ArrayList<Integer>();
        if(S.length()==0||L.length==0)  return result;
        int wordLength = L[0].length();
        int totalLength = wordLength*L.length;
        if(totalLength<wordLength)  return result;
        
        //build the hashtable for all the words in L
        //Notice that the same word may appear in L for more than one times
        Map<String, Integer> wordMap = new HashMap<String, Integer>();
        for(int i=0; i<L.length; i++){
            if(wordMap.containsKey(L[i])){
                int duplicateTimes = wordMap.get(L[i]);
                wordMap.put(L[i], duplicateTimes+1);
            }else{
                wordMap.put(L[i],1);
            }
        }
        
        //from the start of S, check if the substring of length wordLength is in wordMap
        for(int i=0; i<=S.length()-totalLength; i++){
            String curWord = S.substring(i, i+wordLength);
            if(wordMap.containsKey(curWord)){   
                //wordMap contains curWord, start to check other words
                String  curStr = S.substring(i, i+totalLength);
                Map<String, Integer> curMap = new HashMap<String, Integer>();
                int index=0;
                while(index<=curStr.length()-wordLength){
                    String subStr = curStr.substring(index, index+wordLength);
                    index+=wordLength;
                    if(!curMap.containsKey(subStr)) curMap.put(subStr,1);
                    else    curMap.put(subStr, curMap.get(subStr)+1);
                }
                if(wordMap.equals(curMap)){
                    result.add(i);
                }
            }
        }
        return result;
    }
    
}

Note:

方法二对每个有可能符合条件的自串建立一个新的hashmap，然后与wordMap进行比较。

两个map是否相等也可以用equals方法进行比较。