53 - Maximum Subarray

最新推荐文章于 2021-04-26 02:29:15 发布

hellochenlu

最新推荐文章于 2021-04-26 02:29:15 发布

阅读量525

点赞数

分类专栏： LeetCode leetcode解法大全

本文链接：https://blog.csdn.net/hellochenlu/article/details/50817416

版权

LeetCode 同时被 2 个专栏收录

41 篇文章 0 订阅

订阅专栏

leetcode解法大全

5 篇文章 3 订阅

订阅专栏

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.

click to show more practice.

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.

思路分析：

当前下标i的值nums[i] 和 包含当前下标nums[i]的值的前项和，比较两者大小

ret值表示当前最大值

/*
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.
*/

#include "stdafx.h"
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

class Solution_053_MaximumSubarray
{
public:
	int maxSubArray(vector<int>& nums)
	{
		//−2,1,−3,4,−1,2,1,−5,4
		int n = nums.size();
		int ret = INT_MIN;
		int sum = 0;
		for (int i = 0; i < n; i++)
		{
			sum = max(sum + nums[i], nums[i]);
			ret = max(sum, ret);
		}

		return ret;
	}
};