class Solution:
def maxSubArray(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
sum = 0
Maxsum = nums[0]
for i in range(len(nums)):
sum += nums[i]
if sum > Maxsum:
Maxsum = sum
if sum < 0:
sum = 0
return Maxsum
53.最大子序和(通过)Python
最新推荐文章于 2021-08-19 16:31:45 发布