LeetCode 53 – Python 3 (Week 2 – 02)

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