任务描述
思路
- 每次记录当前最大子序和,子序和为负时置0重新开始新子序的求和
实现代码
class Solution:
def maxSubArray(self, nums: List[int]) -> int:
maxs = nums[0]
sums = 0
for i in nums:
sums += i
if sums>maxs:
maxs = sums
if sums<0:
sums = 0
return maxs