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

Fixed incorrect function name in test cases

Browse Source
This commit is contained in:
Wilson Strasilla 2024-10-17 15:28:24 -07:00
parent deb7f89291
commit 85fcd387cc
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
strings/min_window_substring.py
View File

@ -5,9 +5,9 @@ def min_window(search_str: str, target_letters: str) -> str:
all target char_dict. all target char_dict.
>>> min_window("Hello World", "lWl") >>> min_window("Hello World", "lWl")
"llo W" 'llo W'
>>> min_window("Hello World", "f") >>> min_window("Hello World", "f")
"" ''
This solution uses a sliding window, alternating between shifting This solution uses a sliding window, alternating between shifting
the end of the window right until all target char_dict are contained the end of the window right until all target char_dict are contained
@ -28,7 +28,7 @@ def min_window(search_str: str, target_letters: str) -> str:
# Return if not possible due to string lengths. # Return if not possible due to string lengths.
if search_len < target_count: if search_len < target_count:
return "" return ''
# Build dictionary with counts for each letter in target_letters # Build dictionary with counts for each letter in target_letters
char_dict = {} char_dict = {}
@ -82,4 +82,4 @@ def min_window(search_str: str, target_letters: str) -> str:
if exists: if exists:
return search_str[min_window[0] : min_window[1]] return search_str[min_window[0] : min_window[1]]
else: else:
return "" return ''