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.

class Solution {public:    int maxSubArray(int A[], int n) {        if(n <= 0)return 0;for(int i = 1; i < n; i++)A[i] += A[i - 1];int maxsum = INT_MIN;int minsum = 0;//最开始minsum为0 for(int i = 0; i < n; i++){maxsum = max(maxsum, A[i] - minsum);//先计算当前的最大值再更新 minsumminsum = min(minsum, A[i]);}return maxsum;    }};