[leetcode]Substring with Concatenation of All Words @ Python

原題地址：https://oj.leetcode.com/problems/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中每個單詞的數量。由於每個單詞的長度一樣，以題中給的例子而言，可以3個字母3個字母的檢查，如果不在字典中，則break出循環。有一個技巧是建立一個臨時字典curr，用來統計S中那些在L中的單詞的數量，必須和L中單詞的數量相等，否則同樣break。

代碼：

class Solution:
    # @param S, a string
    # @param L, a list of string
    # @return a list of integer
    def findSubstring(self, S, L):
        words={}
        wordNum=len(L)
        for i in L:
            if i not in words:
                words[i]=1
            else:
                words[i]+=1
        wordLen=len(L[0])
        res=[]
        for i in range(len(S)+1-wordLen*wordNum):
            curr={}; j=0
            while j<wordNum:
                word=S[i+j*wordLen:i+j*wordLen+wordLen]
                if word not in words: 
                    break
                if word not in curr: 
                    curr[word]=1
                else:
                    curr[word]+=1
                if curr[word]>words[word]: break
                j+=1
            if j==wordNum: res.append(i)
        return res