本方法+1

class Solution:
    def findAnagrams(self, s: str, p: str) -> List[int]:
        target_n, n = len(p), len(s)
        sp = sorted(p)
        result = []
        for index in range(n - target_n + 1):
            temp = s[index : index+target_n]
            if sorted(temp) == sp:
                result.append(index)
        return result