class Solution(object):
def maxSubArray(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
sub_sum = nums[0]
max_sum = nums[0]
for i in range(1, len(nums)):
if sub_sum < 0:
sub_sum = nums[i]
else:
sub_sum += nums[i]
if sub_sum > max_sum:
max_sum = sub_sum
return max_sum
剑指Offer:连续子数组的最大和
最新推荐文章于 2022-09-09 11:31:16 发布