[leetcode] 438. Find All Anagrams in a String @ python

Given a string s and a non-empty string p, find all the start indices of p’s anagrams in s.

Strings consists of lowercase English letters only and the length of both strings s and p will not be larger than 20,100.

The order of output does not matter.

Example 1:

Input:
s: “cbaebabacd” p: “abc”

Output:
[0, 6]

Explanation:
The substring with start index = 0 is “cba”, which is an anagram of “abc”.
The substring with start index = 6 is “bac”, which is an anagram of “abc”.
Example 2:

Input:
s: “abab” p: “ab”

Output:
[0, 1, 2]

Explanation:
The substring with start index = 0 is “ab”, which is an anagram of “ab”.
The substring with start index = 1 is “ba”, which is an anagram of “ab”.
The substring with start index = 2 is “ab”, which is an anagram of “ab”.

解法

使用滑动窗口, 遍历S, 统计长度为P的子字符串是否是P的回文. 判断回文我们用字典统计字符串中每个字符的出现次数, 如果两个字典相同则是回文.
Time: O(n)
Space: O(n)

代码

class Solution:
    def findAnagrams(self, s, p):
        """
        :type s: str
        :type p: str
        :rtype: List[int]
        """        
        ans = []
        # edge case
        if len(s) < len(p): return ans
        
        count_p = collections.Counter(p)        
        len_p = len(p)
        count_s = collections.Counter(s[:len_p-1])
        
        for start in range(len(s)-len(p)+1):
            end = start+len_p-1
            count_s[s[end]] = count_s.get(s[end], 0) + 1
            # check if the two dict are the same
            if count_s == count_p:
                ans.append(start)
            # delete the first char
            count_s[s[start]] -= 1
            if count_s[s[start]] == 0:
                del count_s[s[start]]
                
        return ans