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
.
More practice:
If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.
思路:建立一个数组,用来存放以当前位置结尾的子序列的和的最大值,最后找出该数组中的最大值即可
代码:
class Solution {
public:
int maxSubArray(int A[], int n) {
int dp[n];
dp[0]=A[0];
for(int i=1;i<n;i++){
if(dp[i-1]>0) dp[i]=dp[i-1]+A[i];
else{
dp[i]=A[i];
}
}
int max=dp[0];
for(int i=1;i<n;i++){
if(dp[i]>max) max=dp[i];
}
return max;
}
};