[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/longest_sub_array.py

@@ -10,32 +10,32 @@
 """
 
 
-def longest_sub_array(arr:list):
+def longest_sub_array(arr: list):
     """
-       Find the longest continuous subarray with the maximum sum.
+    Find the longest continuous subarray with the maximum sum.
 
-       Args:
-       arr (list): A list of integers.
+    Args:
+    arr (list): A list of integers.
 
-       Returns:
-       A Integer which is the max subarray sum in the whole array.
+    Returns:
+    A Integer which is the max subarray sum in the whole array.
 
-       Examples:
-       >>> longest_sub_array([1, 2, 3, 2, 5])
-       13
+    Examples:
+    >>> longest_sub_array([1, 2, 3, 2, 5])
+    13
 
-       >>> longest_sub_array([5, -4, 3, -2, 1])
-       5
+    >>> longest_sub_array([5, -4, 3, -2, 1])
+    5
 
-       >>> longest_sub_array([1, 2, 3, -2, 5])
-       9
+    >>> longest_sub_array([1, 2, 3, -2, 5])
+    9
 
-       >>> longest_sub_array([10, 20, -30, 40, 50])
-       90
+    >>> longest_sub_array([10, 20, -30, 40, 50])
+    90
 
-       >>> longest_sub_array([])
-       0
-       """
+    >>> longest_sub_array([])
+    0
+    """
 
     max_so_far = arr[0]
     max_ending_here = arr[0]
@@ -58,7 +58,6 @@ def longest_sub_array(arr:list):
     return max_len
 
 
-
 if __name__ == "__main__":
     import doctest