题目:
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.
class Solution {
public:
int maxSubArray(vector<int>& nums) {
if(nums.empty()) return 0;
int largestSum = nums[0];//注意初始化
int curSum = nums[0];//注意初始化
for(int i = 1; i < nums.size(); ++i){
curSum = curSum > 0 ? curSum + nums[i] : nums[i];
largestSum = largestSum > curSum ? largestSum : curSum;
}
return largestSum;
}
};