[leetcode] 53. Maximum Subarray

class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        bstsum = -sys.maxsize
        crsum = 0
        
        for num in nums :
            crsum = max(num, num + crsum)
            bstsum = max(crsum, bstsum)
        return bstsum