给定一个整数数组 nums ,找到一个具有最大和的连续子数组(子数组最少包含一个元素),返回其最大和。
示例:
输入: [-2,1,-3,4,-1,2,1,-5,4],
输出: 6
解释: 连续子数组 [4,-1,2,1] 的和最大,为 6。
进阶:
如果你已经实现复杂度为 O(n) 的解法,尝试使用更为精妙的分治法求解。
解法1 动态规划 O(n)
sum[i] 表示以索引i结尾的子数组中的最大和
- i = 0时,sum[0] = nums[0]
- i > 0时,sum[i] = max(sum[i - 1] + nums[i], nums[i])
class Solution:
def maxSubArray(self, nums: List[int]) -> int:
sum = []
sum.append(nums[0])
n = len(nums)
for i in range(1, n):
sum.append(max(sum[i - 1] + nums[i], nums[i]))
return max(sum)
同样地,我们也可以将sum[i] 表示为 以索引i开头的子数组中的最大和
则
- i = n - 1时,sum[n - 1] = nums[n - 1]
- i < n - 1时,sum[i] = max(nums[i] + sum[i + 1], nums[i])
class Solution:
def maxSubArray(self, nums: List[int]) -> int:
n = len(nums)
if n == 1:
return nums[0]
sum = [0 for i in range(n)]
sum[n - 1] = nums[n - 1]
for i in range(n - 2, -1, -1):
sum[i] = max(nums[i] + sum[i + 1], nums[i])
return max(sum)
解法2 分治递归 O(nlogn)
将数组分为三部分 左 中 右 分别求最大和
class Solution:
def maxSubArray(self, nums: List[int]) -> int:
n = len(nums)
left = 0
right = n - 1
maxSum = self.divide(nums, left, right)
return maxSum
def divide(self, nums, left, right):
if left == right:
return nums[left]
mid = (left + right) // 2
leftMaxSum = self.divide(nums, left, mid)
rightMaxSum = self.divide(nums, mid + 1, right)
leftBorderSum = nums[mid]
leftTempSum = nums[mid]
for i in range(mid - 1, left - 1, -1):
leftTempSum += nums[i]
if leftTempSum > leftBorderSum:
leftBorderSum = leftTempSum
rightBorderSum = nums[mid + 1]
rightTempSum = nums[mid + 1]
for i in range(mid + 2, right + 1):
rightTempSum += nums[i]
if rightTempSum > rightBorderSum:
rightBorderSum = rightTempSum
BorderMaxSum = leftBorderSum + rightBorderSum
return max(leftMaxSum, BorderMaxSum, rightMaxSum)
https://blog.csdn.net/weixin_41958153/article/details/81131379