【leetcode】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).

解析：给定一个字符串S和一个列表L的单词，所有单词都是相等长度的。找出S出所有的子串的起始坐标，这些子串要满足L中单词的无间隙拼接。

        将L中的单词用HashMap进行保存，即定义map对象，其中key表示字符串单词，value表示单词出现的次数。遍历字符串S后，将统计的结果和map进行比对，判断是否要加入结果list中。

Java AC代码：

public class Solution {
	public List<Integer> findSubstring(String S, String[] L) {
		Map<String, Integer> map = new HashMap<String, Integer>();

		for (int i = 0; i < L.length; i++) {
			if (map.containsKey(L[i])) {
				map.put(L[i], map.get(L[i]) + 1);
			} else {
				map.put(L[i], 1);
			}
		}

		List<Integer> res = new ArrayList<Integer>();

		for (int j = 0; j <= S.length() - L[0].length() * L.length; j++) {
			boolean ifAdded = true;
			Map<String, Integer> mapTemp = new HashMap<String, Integer>();
			for (int k = j; k < S.length() && k < j + L[0].length() * L.length; k += L[0].length()) {
				String temp = S.substring(k, k + L[0].length());
				if (mapTemp.containsKey(temp)) {
					mapTemp.put(temp, mapTemp.get(temp) + 1);
				} else {
					mapTemp.put(temp, 1);
				}
				if (!map.containsKey(temp) || map.get(temp) < mapTemp.get(temp)) {
					ifAdded = false;
					break;
				}
			}
			if(ifAdded){
				res.add(j);
			}
		}
		return res;
	}
}