53. Maximum Subarray - LeetCode Solution

class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        
        if len(nums)==1:
            return nums[0]
        
        sum = 0
        max = -10000000000
        
        start = 0
        
        for i in nums:
            sum+=i
            
            if max<sum:
                max = sum
            
            if sum<0:
                sum = 0
                continue
                
            

        
        return max