[리트코드 leetcode] 53. Maximum Subarray

leetcode.com/problems/maximum-subarray/

Maximum Subarray - LeetCode

class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        maximum= -sys.maxsize
        sum=0
        for num in nums:
            sum+=num
            maximum = max(maximum, sum)
            if sum < 0 and num <0:
                sum = 0
            
        return maximum