leetcode438 -- find all anagrams in a string

# 小郑之家~

### 题目

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".



class Solution(object):
def findAnagrams(self, s, p):
"""
:type s: str
:type p: str
:rtype: List[int]
"""

temp = self.helper(p)
res = []
for i in range(0,len(s)-len(p)+1):
ss = s[i:len(p)+i]
if self.helper(ss)==temp:
res.append(i)
return res

def helper(self, ss):
dic = [0]*26
for i in range(len(ss)):
dic[ord(ss[i])-ord('a')] += 1
return dic



a代表97, z代表122