[LeetCode]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;        int Max = A[0];        int curMax = A[0];        for (int i = 1; i < n; i++){            curMax = max(A[i], curMax + A[i]);            Max = max(curMax, Max);        }        return Max;    }};