题目描述
给定一个整数数组 nums
,找到一个具有最大和的连续子数组(子数组最少包含一个元素),返回其最大和。
示例
输入: [-2,1,-3,4,-1,2,1,-5,4],
输出: 6
解释: 连续子数组 [4,-1,2,1] 的和最大,为 6。
进阶:
如果你已经实现复杂度为 O(n) 的解法,尝试使用更为精妙的分治法求解。
思路1
贪心。
时间复杂度O(n)。
代码1
class Solution {
public:
int maxSubArray(vector<int>& nums) {
int maxSum = INT_MIN;
int sum = 0;
for (auto value : nums){
sum += value;
maxSum = max(sum, maxSum);
if (sum < 0) sum = 0;
}
return maxSum;
}
};
思路2
以数组mid将数组分成左右两部分,最大子序和只有3中情况:
(1)最大子序在数组左边
(2)最大子序在数组右边
(3)最大子序在mid两侧,这个时候需要在mid左右两边继续求最大子序和
代码2
class Solution {
public:
int maxSubArray(vector<int>& nums) {
int n = nums.size();
if (n == 0) return 0;
if (n == 1) return nums[0];
return findMaxSubArray(nums, 0, n-1);
}
int findMaxSubArray(vector<int>& nums, int left, int right){
if (left == right) return nums[left];
int mid = (left+right) / 2;
int leftSum = findMaxSubArray(nums, left, mid);
int rightSum = findMaxSubArray(nums, mid+1, right);
int sum = maxSubArrayMerge(nums, left, mid, right);
return max(max(leftSum,rightSum), sum);
}
int maxSubArrayMerge(vector<int>& nums, int left, int mid, int right){
int leftSum = 0, rightSum = 0;
int leftMax = INT_MIN, rightMax = INT_MIN;
for (int i = mid; i >= left; --i){
leftSum += nums[i];
leftMax = max(leftMax, leftSum);
}
for (int i = mid+1; i <= right; ++i){
rightSum += nums[i];
rightMax = max(rightMax, rightSum);
}
return leftMax + rightMax;
}
};