Maximum Subarray
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.
My Submitted Code
动态规划,公式:
arr[0] = A[0] , i = 0
arr[i] = max (A[i] , A[i] + arr[i - 1]), i > 0
class Solution {
public:
int maxSubArray(int A[], int n) {
int* maxarr=new int[n];
maxarr[0]=A[0];
for(int i=1;i<n;i++){
maxarr[i]=max(A[i],A[i]+maxarr[i-1]);
}
int ret=maxarr[0];
for(int i=1;i<n;i++){
if(maxarr[i]>ret){
ret=maxarr[i];
}
}
return ret;
}
};