We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 9a572de commit d1af580Copy full SHA for d1af580
strings/Permutation_in_String.py
@@ -0,0 +1,29 @@
1
+from collections import Counter
2
+
3
+class Solution:
4
+ def checkInclusion(self, s1: str, s2: str) -> bool:
5
+ n1, n2 = len(s1), len(s2)
6
+ if n2 < n1:
7
+ return False
8
+ freq1, freq2 = Counter(s1), Counter(s2[0:n1])
9
+ if freq1 == freq2:
10
+ return True
11
+ l, r = 1, n1
12
+ while r < n2:
13
+ freq2[s2[l-1]] -= 1
14
+ if freq2[s2[l-1]] == 0:
15
+ del freq2[s2[l-1]]
16
+ freq2[s2[r]] += 1
17
18
19
+ r += 1
20
+ l += 1
21
22
23
+if __name__ == "__main__":
24
+ s1 = "ab" #update s1
25
+ s2 = "eidbaooo" #update s2
26
27
+ sol = Solution()
28
+ result = sol.checkInclusion(s1, s2)
29
+ print(result)
0 commit comments