code53: Maximum Subarray
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
Explanation: [4,-1,2,1] has the largest sum = 6.
解答
此题并不算难,这里是提供一个想法 以及该想法的简化版本
Kadane Algorithm:
寻找数组最大子数组元素和
提供两个中间参数 sum_max sum_current
sum_max记录过程中最大的和
sum_current记录过程中当前的最大和:假如前一位为正数,则sum_current应该+=nums[i]。(肯定比nums[i]大),如果为负数(或者说前面的和为负数),则赋值为nums[i]。
代码:
class Solution:
def maxSubArray(self, nums: List[int]) -> int:
sum_max = nums[0]
sum_current = nums[0]
for i in range(1,len(nums)):
sum_current += nums[i]
if sum_current > nums[i]:
sum_max = max(sum_max,sum_current)
else:
sum_max = max(sum_max,nums[i])
sum_current = nums[i]
return sum_max
优化使代码更优雅:
注意下这是个求和的游戏,所以我们可以直接对数组内元素进行修改,因为一次遍历完就不再使用了。
将当前nums[i]赋值为nums[i]+nums[i-1](如果前面为正数的话),遍历一遍以后,max取最大值。
代码:
class Solution:
def maxSubArray(self, nums: List[int]) -> int:
for i in range(1,len(nums)):
if nums[i-1] >0:
nums[i] += nums[i-1]
return max(nums)