Maximum Subarray Python Solution with Tests

lcpy gen -n 53   # by problem number
lcpy gen -s maximum_subarray   # by problem name

Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6

Input: nums = [1]
Output: 1

Input: nums = [5,4,-1,7,8]
Output: 23

class Solution:
    # Time: O(n)
    # Space: O(1)
    def max_sub_array(self, nums: list[int]) -> int:
        max_sum = current_sum = nums[0]

        for i in range(1, len(nums)):
            current_sum = max(nums[i], current_sum + nums[i])
            max_sum = max(max_sum, current_sum)

        return max_sum