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
.
int maxSubArray(int A[], int n) { int sum = 0; int largesum = INT_MIN; for (int i = 0; i != n;++i) { sum += A[i]; if (sum <= 0) { sum = 0; largesum = A[i] > largesum ? A[i] : largesum; } else largesum = sum > largesum ? sum : largesum; } return largesum; }
原文:http://blog.csdn.net/li_chihang/article/details/44599171