[LeetCode] Substring with Concatenation of All Words 串联所有单词的子串

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

For example, given:
s: "barfoothefoobarman"
words: ["foo", "bar"]

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

http://yucoding.blogspot.com/2013/09/leetcode-question-106-substring-with.html

http://blog.unieagle.net/2012/10/28/leetcode%E9%A2%98%E7%9B%AE%EF%BC%9Asubstring-with-concatenation-of-all-words/

[LeetCode] Substring with Concatenation of All Words 串联所有单词的子串

原文：http://www.cnblogs.com/grandyang/p/4521224.html