mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-10-05 21:29:29 +00:00
Code Issues Packages Projects Releases Wiki Activity

[pre-commit.ci] auto fixes from pre-commit.com hooks

Browse Source 
for more information, see https://pre-commit.ci
This commit is contained in:
pre-commit-ci[bot] 2024-10-05 08:56:02 +00:00
parent 83e1d4a983
commit ea87c243c3
1 changed files with 6 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
strings/permutation_in_string.py
View File

@ -1,5 +1,6 @@
from collections import Counter
class Solution:
def check_inclusion(self, s1: str, s2: str) -> bool:
n1, n2 = len(s1), len(s2)
@ -10,9 +11,9 @@ class Solution:
return True
left, right = 1, n1
while right < n2:
freq2[s2[left-1]] -= 1
if freq2[s2[left-1]] == 0:
del freq2[s2[left-1]] # Remove characters with zero frequency
freq2[s2[left - 1]] -= 1
if freq2[s2[left - 1]] == 0:
del freq2[s2[left - 1]] # Remove characters with zero frequency
freq2[s2[right]] += 1
if freq1 == freq2:
return True
@ -20,11 +21,12 @@ class Solution:
left += 1
return False
# Test the function
if __name__ == "__main__":
s1 = "ab"
s2 = "eidbaooo"
sol = Solution()
result = sol.check_inclusion(s1, s2)
print(result) # Should return True or False based on the input strings