53. 最大子序和

最新推荐文章于 2019-12-06 16:04:14 发布

心向暖

最新推荐文章于 2019-12-06 16:04:14 发布

阅读量87

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/fadbgfnbxb/article/details/94358444

版权

leetcode 专栏收录该内容

96 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <algorithm>
#include "string"
#include "vector"
#include "stack"
using namespace std;

int maxSubArray(vector<int>& nums) 
{
	int sumMax = nums[0];
	int sum = 0;
	for (int i:nums)
	{
		if (sum > 0)
			sum += i;
		else
			sum = i;

		sumMax = max(sumMax, sum);
	}
	return sumMax;
}

int main()
{
	vector<int>v;
	v.push_back(-2);
	v.push_back(1);
	v.push_back(-3);
	v.push_back(4);
	v.push_back(-1);
	v.push_back(2);
	v.push_back(1);
	v.push_back(-5);
	v.push_back(4);
	
	cout << maxSubArray(v) << endl;
	
	system("pause");
	return 0;
}