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

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

data_structures/arrays/majority_element.py

@@ -2,6 +2,7 @@
 Find the majority element in an array.
 """
 
+
 def majority_element(nums: list[int]) -> int:
     """
     Find the element that appears more than n/2 times using
@@ -25,11 +26,12 @@ def majority_element(nums: list[int]) -> int:
     for num in nums:
         if count == 0:
             candidate = num
-        count += (1 if num == candidate else -1)
+        count += 1 if num == candidate else -1
 
     return candidate
 
 
 if __name__ == "__main__":
     import doctest
+
     doctest.testmod()

data_structures/arrays/maximum_subarray.py

@@ -2,6 +2,7 @@
 Find the maximum subarray sum (Kadane's Algorithm).
 """
 
+
 def max_subarray(nums: list[int]) -> int:
     """
     Find the contiguous subarray with the largest sum.
@@ -31,4 +32,5 @@ def max_subarray(nums: list[int]) -> int:
 
 if __name__ == "__main__":
     import doctest
+
     doctest.testmod()

data_structures/arrays/rotate_array.py

@@ -2,6 +2,7 @@
 Rotate an array to the right by k steps.
 """
 
+
 def rotate(nums: list[int], k: int) -> list[int]:
     """
     Rotate the array to the right by k steps.
@@ -28,4 +29,5 @@ def rotate(nums: list[int], k: int) -> list[int]:
 
 if __name__ == "__main__":
     import doctest
+
     doctest.testmod()