leetcode刷题53
Maximum Subarray
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
.
class Solution {
public:
int maxSubArray(vector<int>& nums) {
int sum = *nums.begin(), cur = 0;
vector<int>::iterator it;
for (it = nums.begin(); it != nums.end(); ++it)
{
cur += *it;
if (cur > sum)
sum = cur;
if (cur < 0)
cur = 0;
}
return sum;
}
};
额外要求里有更难的方法,,,暂且搁置。。。