LeetCode: 53. Maximum Subarray

class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        ret = -int(1e9)
        now = 0
        for num in nums:
            now += num
            ret = max(ret, now)
            if now <= 0:
                now = 0
        return ret