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.
解题报告：kadane算法，复杂度O（n）。
class Solution {
public:
int maxSubArray(int A[], int n) {
int max_so_far = A[0];
int max_ending_here = 0;
for(int i = 0; i != n; i++) {
max_ending_here = max_ending_here + A[i];
if(max_so_far < max_ending_here)
max_so_far = max_ending_here;
if(max_ending_here < 0)
max_ending_here = 0;
}
return max_so_far;
}
};
原文：http://blog.csdn.net/vanish_dust/article/details/42681095