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:
If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.
Solution:
class Solution {
public:
int maxSubArray(vector<int>& nums) {
if(!nums.size()) return 0;
int start = 0, maxSum = nums[0];
while(start < nums.size())
{
int sum = 0, i = start;
for(; i < nums.size(); ++i)
{
sum += nums[i];
maxSum = max(maxSum, sum);
if(sum < 0)
{
start = i + 1;
break;
}
}
if(i == nums.size()) break;
}
return maxSum;
}
};