Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
Example:
Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Example:
Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.
code:
class Solution(object):
def maxSubArray(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
for i in range(1, len(nums)):
nums[i] = max(nums[i-1] + nums[i], nums[i])
return max(nums)
笔记:1 通过这题解决了之前的一个误区:
for i in range(len(nums)):
for j in range(i+1,len(nums)):
控制前面的j加没得用,后面才控制起始位置
2 这题的核心是要连续的相加,上面的问题是隔开了,并不是连续的和
相连的两个数相加和原来的没加的相比较,大的就保存,和之前一题相似