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.
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 sum=0,maxSum=INT_MIN;
for(int i=0;i<n;i++){
if(sum>=0)sum+=A[i];
else sum=A[i];
maxSum=max(maxSum,sum);
}
return maxSum;
}
};原文：http://blog.csdn.net/starcuan/article/details/18861935