leetcode——30. 串联所有单词的子串

class Solution:
    def findSubstring(self, s: str, words):
        if s==‘‘ or words==[]:return []
        n=len(words)
        m=len(words[0])
        r=[]
        i=0
        while i<len(s)-m*n+1:
            for j in words:
                p=s[i:i+m*n]
                t=list(p[m*i:m*(i+1)] for i in range(n))
                if t.count(j)!=words.count(j):
                    i+=1
                    break
            else:
                r.append(i)
                i+=1
        return r