力扣 53. 最大子数组和

2022-07-30

Word count: 32 | Reading time≈ 1 min

动态规划

def maxSubArray(nums):
    cur, ret = float("-inf"), float("-inf")
    for n in nums:
        cur = max(n, cur + n)
        ret = max(cur, ret)
    return ret

Copyright： Copyright is owned by the author. For commercial reprints, please contact the author for authorization. For non-commercial reprints, please indicate the source.