-
Notifications
You must be signed in to change notification settings - Fork 0
/
Find All Anagrams in a String.py
57 lines (39 loc) · 1.41 KB
/
Find All Anagrams in a String.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
# 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".
class Solution:
def findAnagrams(self, s: str, p: str) -> List[int]:
def Counter(a):
d = {}
for c in a:
d[c] = d.get(c,0) + 1
return d
ans = []
pl = len(p)
dp = Counter(p)
ds = Counter(s[:pl-1])
for i in range(pl-1,len(s)):
ds[s[i]] = ds.get(s[i],0) + 1
if ds == dp:
ans.append(i-pl+1)
ds[s[i-pl+1]] = ds.get(s[i-pl+1],1) - 1
if ds[s[i-pl+1]] == 0:
del ds[s[i-pl+1]]
return ans