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 size = nums.size();
int sum = nums[0];
int max = nums[0];
for(int i = 0; i < size; i ++)
{
if(i != 0) sum += nums[i];
if(sum > max) max = sum;
if(sum < 0) sum = 0;
}
return max;
}
};
转载请注明原文地址: https://ju.6miu.com/read-34109.html
