题目:
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
样例:For example, given the array [-2,1,-3,4,-1,2,1,-5,4]
,
the contiguous subarray [4,-1,2,1]
has the largest sum = 6
.
这道题目要求找的是最大子数组,假设最大子数组是[i,k],其和为正数,那么其前j项(j <= k)之和必定为正数,否则sum[j + 1, k] > sum[i,j],得到这一结论,我们就可以设置一个临时变量用来计算前k个输之和,若为负,则将其置为0,否则判断其是否比当前最大值大。当k=n时,就找到了最大子串。
提交代码:
class Solution {
public:
int maxSubArray(int A[], int n) {
int ans=A[0],i,j,sum=0;
for(i=0;i<n;i++){
sum+=A[i];
ans=max(sum,ans);
sum=max(sum,0);
}
return ans;
}
};
如果分治算法的话,因为最大子数组分成三种清况:只包含第一项、只包含最后一项、都不包含。那么我们可以将原数组从n / 2分成两部分,计算出每一部分的包含第一项的最大子数组、包含最后一项的最大子数组和最大子数组,然后将两部分进行合并。
提交代码:
struct val {
int l, m, r, s;
val(int a = 0, int b = 0, int c = 0, int d = 0) {
l = a;
m = b;
r = c;
s = d;
}
};
class Solution {
public:
val sum(int nums[], int n) {
if(n == 1) {
return val(nums[0], nums[0], nums[0], nums[0]);
}
val v1, v2;
v1 = sum(nums, n / 2);
v2 = sum(nums + n / 2, n - n / 2);
int l, m, r, s;
l = max(v1.l, v1. s + v2.l);
m = max(v1.r + v2.l, max(v1.m, v2.m));
r = max(v2.r, v1.r + v2.s);
s = v1.s + v2.s;
return val(l, m, r, s);
}
int maxSubArray(vector<int>& nums) {
int cnum[nums.size()], n = nums.size();
for(int i = 0; i < nums.size(); i++)
cnum[i] = nums[i];
val v = sum(cnum, n);
return v.m;
}
};