给定一个整数数组 nums ,找到一个具有最大和的连续子数组(子数组最少包含一个元素),返回其最大和。
示例:
输入: [-2,1,-3,4,-1,2,1,-5,4],
输出: 6
解释: 连续子数组 [4,-1,2,1] 的和最大,为 6。
#include <stdio.h>
#include <vector>
#include <iostream>
using namespace std;
int maxSubArray(vector<int>& nums)
{
int tmpSize = nums.size();
if (tmpSize == 0)
return 0;
else if (tmpSize == 1)
return nums.back();
int maxValue = nums.front();
int locValue = maxValue;
for (int i = 1;i < tmpSize;++ i)
{
if (locValue < 0) // nums[i]之前的总和为负则舍弃,重新赋值为nums[i](负数 + A < A)
locValue = nums[i];
else
locValue += nums[i];
if (maxValue < locValue)
maxValue = locValue;
}
return maxValue;
}
int main()
{
vector<int> v1,v2;
v1.push_back(-2); v1.push_back(1);
v1.push_back(-3); v1.push_back(4);
v1.push_back(-1); v1.push_back(2);
v1.push_back(1), v1.push_back(-5);
v1.push_back(4);
v2.push_back(7); v2.push_back(6);
v2.push_back(4); v2.push_back(3);
v2.push_back(1);
printf("%d\n",maxSubArray(v1));
printf("%d\n",maxSubArray(v2));
return 0;
}