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:
Solution:
If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.
Code:
<span style="font-size:14px;">class Solution {
public:
int maxSubArray(int A[], int n) {
int result = A[0];
for (int i = 1; i < n; ++i) {
A[i] = max(A[i], A[i-1]+A[i]);
result = max(result, A[i]);
}
return result;
}
};</span>