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.
Consideration: slightly different from 121. Best Time to Buy and Sell Stock
class Solution {
public:
inline int max(int a, int b){
return a > b ? a : b;
}
int maxSubArray(vector<int>& nums) {
if(nums.size() <= 0) return 0;
if(nums.size() == 1) return nums[0];
int max_so_far = nums[0], max_ending_here = nums[0];
for(int i=1;i<nums.size();i++){
max_ending_here = max(nums[i], max_ending_here + nums[i]);
max_so_far = max(max_so_far, max_ending_here);
}
return max_so_far;
}
};
