LeetCode 438. Find All Anagrams in a String--字符串-滑动窗口--C++,Python解法

题目地址：Find All Anagrams in a String - LeetCode

---

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字符串的所有可能都列出来，太多了，于是我想到使用counter。

Python解法如下：

from collections import Counter
class Solution:
    def findAnagrams(self, s: str, p: str) -> List[int]:
        res = []
        p_set = dict(Counter(p))
        lens = len(s)
        lenp = len(p)
        if lens < lenp:
            return res
        for i in range(0, lens-lenp+1):
            s_set = dict(Counter(s[i:i+lenp]))
            if s_set == p_set:
                res.append(i)
        return res

但上面的原