方法一:超出时间限制
class Solution:
def findAnagrams(self, s: str, p: str) -> List[int]:
list_p=list(p)
list_p.sort()
list_index=[]
for i in range(len(s)):
list_s=list(s[i:i+len(p)])
list_s.sort()
if list_s==list_p:
list_index.append(i)
return list_index
方法二:看题解
class Solution:
def findAnagrams(self, s: str, p: str) -> List[int]:
dict_p={}
for char in p:
dict_p[char]=dict_p.get(char,0)+1
dict_s={}
left,right=0,0
res=[]
while right<len(s):
dict_s[s[right]]=dict_s.get(s[right],0)+1
if right-left+1==len(p):
if dict_p==dict_s:
res.append(left)
dict_s[s[left]]-=1
if dict_s[s[left]]==0:
del dict_s[s[left]]
left+=1
right+=1
return res