添加鏈接描述
class Solution:def findAnagrams(self, s: str, p: str) -> List[int]:sildingstr=''result=[]p=''.join(sorted(p))for i in range(len(s)):if len(sildingstr)<len(p):sildingstr=sildingstr+s[i]# print(sildingstr)if len(sildingstr)==len(p):sort_sildingstr=''.join(sorted(sildingstr))if sort_sildingstr==p:result.append(i-len(p)+1)sildingstr=sildingstr[1:]else:sildingstr=sildingstr[1:]return result
思路:
- 純正的滑動窗口
- 笑死我了,差點超時,怎么可以這么慢!!!
優化:
- 使用哈希表作為判斷工具,這樣就可以不對字符串進行排序
class Solution:def findAnagrams(self, s: str, p: str) -> List[int]:n, m, res = len(s), len(p), []if n < m: return resp_cnt = [0] * 26s_cnt = [0] * 26for i in range(m):p_cnt[ord(p[i]) - ord('a')] += 1s_cnt[ord(s[i]) - ord('a')] += 1if s_cnt == p_cnt:res.append(0)for i in range(m, n):s_cnt[ord(s[i - m]) - ord('a')] -= 1s_cnt[ord(s[i]) - ord('a')] += 1if s_cnt == p_cnt:res.append(i - m + 1)return res