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) {
int nowMax = A[0];
int Max = A[0];
for (int i = 1; i < n; i++) {
if (nowMax <= 0) {
nowMax = A[i];
} else {
nowMax += A[i];
}
if (nowMax > Max) Max = nowMax;
}
return Max;
}
};