分治法
分治法思路是将每个递归分为三部分数据
- 左边数据之和
- 右边数据之和
- 从中间扩散,取能扩散的最大值。
每层递归分别获取深层递归左右和,然后本层递归获取中间扩散的值。比较大小返回上一层,如此循环往复。
class Solution {
public:
int maxSubArray(vector<int>& nums) {
return dfs(nums, 0, nums.size()-1);
}
int midAdd(vector<int>& nums, int l, int r, int mid) {
int leftSum = INT_MIN;
int rightSum = INT_MIN;
int sum = 0;
for(int i=mid;i>=l;i--) {
sum += nums[i];
leftSum = max(leftSum, sum);
}
sum = 0;
for(int i=mid+1;i<=r;i++) {
sum += nums[i];
rightSum = max(rightSum, sum);
}
return leftSum+rightSum;
}
int dfs(vector<int>& nums, int l, int r) {
if (l==r) return nums[l];
int mid = l + (r-l)/2;
int lSum = dfs(nums, l, mid);
int rSum = dfs(nums, mid+1, r);
int midSum = midAdd(nums, l, r, mid);
return max(lSum,max(rSum, midSum));
}
};
动态规划
动态转移方程:
f(i)max = max(f(i), f(i-1)max+f(i))
class Solution {
public:
int maxSubArray(vector<int>& nums) {
int ans = nums[0];
int curSum = nums[0];
for(int i=1;i<nums.size();++i) {
curSum = max(curSum+nums[i], nums[i]);
ans = max(curSum, ans);
}
return ans;
}
};