leetcode_practice/solutions/array/0053-maximum-subarray.py at main · juicyzhou/leetcode_practice · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
"""
LeetCode 53. 最大子数组和
https://leetcode.cn/problems/maximum-subarray/
"""

from math import inf
from typing import List


class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        curr_sum = 0
        pre_max = -inf
        for num in nums:
            curr_sum = curr_sum + num
            pre_max = max(pre_max, curr_sum)
            curr_sum = max(curr_sum, 0)
        return pre_max