LeetCode(力扣)53. 最大子数组和Python

题目链接

https://leetcode.cn/problems/maximum-subarray/

代码

class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        result = float('-inf')
        count = 0
        for i in range(len(nums)):
            count += nums[i]
            if count > result:
                result = count
            if count <= 0:
                count = 0
        return result
1
2
3
4
5
6
7
8
9
10
11