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

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

Author: pre-commit-ci[bot]

dynamic_programming/max_sub_array.py

@@ -4,6 +4,7 @@
 """
 from __future__ import annotations
 
+
 def max_sub_array(nums: list[int]) -> int:
     """
     Finds the contiguous subarray which has the largest sum and return its sum.
@@ -26,15 +27,15 @@ def max_sub_array(nums: list[int]) -> int:
     >>> max_sub_array([10, 100, 1000, 10000, 50000, 100000, 200000, 300000, 400000, 500000])
     1561110
     """
-    sol = [0]* (len(a) + 1)
+    sol = [0] * (len(a) + 1)
     for i in range(1, len(sol)):
-        sol[i] = max(sol[i - 1] + a[i -1], a[i - 1])
-        
-    answer  = sol[0]
+        sol[i] = max(sol[i - 1] + a[i - 1], a[i - 1])
+
+    answer = sol[0]
     for i in range(1, len(sol)):
         if answer < sol[i]:
             answer = sol[i]
-    return answer 
+    return answer
 
 
 if __name__ == "__main__":