leetcode 每日一题 30. 串联所有单词的子串

class Solution:
    def findSubstring(self, s: str, words: List[str]) -> List[int]:
        if not s or not words:
            return []
        strlen = len(s)
        listlen = len(words)
        wordlen = len(words[0])
        sbstrlen = listlen * wordlen
        result = []
        for i in range(strlen-sbstrlen+1):
            tempStr = s[i:i+sbstrlen]
            tempArray = []
            for j in range(0,sbstrlen-wordlen+1,wordlen):
                tempArray.append(tempStr[j:j+wordlen])
            isin = True
            for word in words:
                if word not in tempArray:
                    isin = False
                    break
                else:
                    tempArray.remove(word)
            if isin:
                result.append(i)
        return result