给定一个整数数组 nums
,找到一个具有最大和的连续子数组(子数组最少包含一个元素),返回其最大和。
示例:
输入: [-2,1,-3,4,-1,2,1,-5,4], 输出: 6 解释: 连续子数组 [4,-1,2,1] 的和最大,为 6。
进阶:
如果你已经实现复杂度为 O(n) 的解法,尝试使用更为精妙的分治法求解。
思路:
1.动态规划
2.分治法
题解:
1.
class Solution {
public:
//动态规划
int maxSubArray(vector<int>& nums) {
vector<int> v;
v.resize(nums.size());
v[0] = nums[0];
for (int i = 1; i < nums.size(); i++) {
if (v[i-1]>0) {
v[i] = v[i-1] + nums[i];
} else {
v[i] = nums[i];
}
}
return *max_element(v.begin(), v.end());
}
};
class Solution {
public:
//分治法
int maxS(vector<int>& nums, int left, int right) {
if (left==right) {
return nums[left];
}
int maxLeft = maxS(nums, left, (left+right)/2);
int maxRight = maxS(nums, (left+right)/2+1, right);
int sum = 0;
int m1 = nums[(left+right)/2];
for (int i = (left+right)/2; i >= left; i--) {
sum += nums[i];
if (sum>m1) {
m1 = sum;
}
}
sum = 0;
int m2 = nums[(left+right)/2+1];
for (int i = (left+right)/2+1; i <= right; i++) {
sum += nums[i];
if (sum>m2) {
m2 = sum;
}
}
vector<int> tmp;
tmp.push_back(m1+m2);
tmp.push_back(maxLeft);
tmp.push_back(maxRight);
return *max_element(tmp.begin(), tmp.end());
}
int maxSubArray(vector<int>& nums) {
return maxS(nums, 0, nums.size()-1);
}
};