LeetCode 438. Find All Anagrams in a String 时间复杂度(O(n))

最新推荐文章于 2023-03-20 19:34:38 发布

ziyue246

最新推荐文章于 2023-03-20 19:34:38 发布

阅读量139

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/ziyue246/article/details/90175926

版权

LeetCode 专栏收录该内容

112 篇文章 0 订阅

订阅专栏

时间复杂度（O(n)，思想：动态规划

class Solution:
    def findAnagrams(self, s: str, p: str) -> []:
        p_len = len(p)
        p_dict = {}
        r_dict = {}
        positions = []
        for index1, ch1 in enumerate(p):
            if ch1 not in p_dict: p_dict[ch1] = 1
            else: p_dict[ch1] += 1

        for index, ch in enumerate(s):
            if ch not in r_dict : r_dict[ch] = 1
            else: r_dict[ch] += 1
            if index >= p_len - 1:
                if r_dict == p_dict:positions.append(index - p_len + 1)
                first_ch = s[index - p_len + 1]
                if r_dict[first_ch] == 1: r_dict.pop(first_ch)
                else:r_dict[first_ch] -= 1
        return positions