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.

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.

此题为经典的求连续子数组最大和问题，除了暴力的解法，想办法用O(n)时间来做。

直接贴代码：

class Solution {
public:
    int maxSubArray(int A[], int n) {
        if(A == NULL || n < 1)
            return -1;
            
        int max = A[0];
        int temp = 0;
        
        for(int i = 0 ; i < n ; i++){
            if(temp < 0)
                temp = A[i];
            else
                temp += A[i];
                
            if(temp > max)
                max = temp;
        }
        
        return max;
        
    }
};