leetcood学习笔记-53*-最大子列和
题目描述:
方法一:O(N)
class Solution(object): def maxSubArray(self, nums): sum = 0 max_sub_sum = nums[0] for num in nums: sum += num if sum > max_sub_sum: max_sub_sum = sum if sum < 0: sum = 0 return max_sub_sum
二:O(N)/O(1)
class Solution(object): def maxSubArray(self, nums): """ :type nums: List[int] :rtype: int """ for i in range(1, len(nums)): nums[i]= nums[i] + max(nums[i-1], 0) return max(nums)
三:分治法