题目链接

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

代码

class Solution:def maxSubArray(self, nums: List[int]) -> int:result = float('-inf')count = 0for i in range(len(nums)):count += nums[i]if count > result:result = countif count <= 0:count = 0return result