mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-03-31 10:56:43 +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-17 21:20:00 +00:00
parent 00b17c4c7c
commit 7fc42c79f0
1 changed files with 26 additions and 28 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
strings/min_window_substring.py
View File

@ -26,9 +26,8 @@ def min_window(search_str: str, target_letters: str) -> str:
target_count = len(target_letters)
search_len = len(search_str)
# Return if not possible due to string lengths.
if (search_len < target_count):
if search_len < target_count:
return ""
# Build dictionary with counts for each letter in target_letters
@ -47,41 +46,40 @@ def min_window(search_str: str, target_letters: str) -> str:
min_window_len = search_len + 1
# Start sliding window algorithm
while(window_end < search_len):
while window_end < search_len:
# Slide window end right until all search characters are contained
while(target_count > 0 and window_end < search_len):
while target_count > 0 and window_end < search_len:
cur = search_str[window_end]
if cur in char_dict:
char_dict[cur] -= 1
if (char_dict[cur] >= 0):
if char_dict[cur] >= 0:
target_count -= 1
window_end += 1
temp = window_end - window_start
# Check if window is the smallest found so far
if (target_count == 0 and temp < min_window_len):
if target_count == 0 and temp < min_window_len:
min_window = [window_start, window_end]
exists = True
min_window_len = temp
# Slide window start right until a search character exits the window
while(target_count == 0 and window_start < window_end):
while target_count == 0 and window_start < window_end:
cur = search_str[window_start]
window_start += 1
if cur in char_dict:
char_dict[cur] += 1
if (char_dict[cur] > 0):
if char_dict[cur] > 0:
break
temp = window_end - window_start + 1
# Check if window is the smallest found so far
if (temp < min_window_len and target_count == 0):
if temp < min_window_len and target_count == 0:
min_window = [window_start - 1, window_end]
min_window_len = temp
target_count = 1
if (exists):
if exists:
return search_str[min_window[0] : min_window[1]]
else:
return ""