Merge branch 'data_structure/sliding_window/examples-' of https://github.com/lydia321/Python into data_structure/sliding_window/examples-

Author: lydia321

data_structures/sliding_window/longest_substring_two_distinct.py

@@ -22,27 +22,29 @@ def length_of_longest_substring_two_distinct(string: str) -> int:
     n = len(s)
     if n == 0:
         return 0
-    
+
     # Dictionary to store the last occurrence of each character
     char_map = {}
     left = 0
     max_length = 0
-    
+
     # Sliding window approach
     for right in range(n):
         char_map[s[right]] = right
-        
+
         # If we have more than two distinct characters
         if len(char_map) > 2:
             # Remove the leftmost character
             del_idx = min(char_map.values())
             del char_map[s[del_idx]]
             left = del_idx + 1
-        
+
         max_length = max(max_length, right - left + 1)
-    
+
     return max_length
 
+
 if __name__ == "__main__":
     import doctest
+
     doctest.testmod()

data_structures/sliding_window/max_sum_subarray.py

@@ -26,18 +26,20 @@ def max_sum_subarray(array: List[int], subarray_length: int) -> int:
     if n < k or k <= 0:
         print("Invalid input: k is larger than the array size or non-positive")
         return None
-    
+
     # Calculate the sum of the first window of size k
     window_sum = sum(arr[:k])
     max_sum = window_sum
-    
+
     # Slide the window from start to end of the array
     for i in range(n - k):
         window_sum = window_sum - arr[i] + arr[i + k]
         max_sum = max(max_sum, window_sum)
-    
+
     return max_sum
 
+
 if __name__ == "__main__":
     import doctest
+
     doctest.testmod()

data_structures/sliding_window/min_subarray_len.py

@@ -26,18 +26,20 @@ def min_subarray_len(target_sum: int, numbers: List[int]) -> int:
     n = len(nums)
     left = 0
     current_sum = 0
-    min_length = float('inf')
-    
+    min_length = float("inf")
+
     for right in range(n):
         current_sum += nums[right]
-        
+
         while current_sum >= target:
             min_length = min(min_length, right - left + 1)
             current_sum -= nums[left]
             left += 1
-    
-    return min_length if min_length != float('inf') else 0
+
+    return min_length if min_length != float("inf") else 0
+
 
 if __name__ == "__main__":
     import doctest
+
     doctest.testmod()