【leedcode】53. Maximum Subarray
来源:互联网 发布:签到赚钱的软件 编辑:程序博客网 时间:2024/06/13 20:46
题目:
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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Solution {
public:
int maxSubArray(vector<int>& nums) {
int res = nums[0];
int sum = 0;
for (int i = 0; i < nums.size(); i++) {
sum += nums[i];
res = max(sum, res);
sum = max(sum,0);
}
return res;
}
};
0 0
- 【leedcode】53. Maximum Subarray
- [leedcode]--53. Maximum Subarray
- LeedCode 之 Maximum Subarray
- [LeedCode OJ]#53 Maximum Subarray
- (leedcode)152. Maximum Product Subarray
- leedcode做题总结,动态规划II(Maximum Subarray,Maximum Product Subarray)
- leedcode做题总结, 题目Maximum Subarray II & Maximum Subarray Difference
- [LeetCode]53.Maximum Subarray
- LeetCode --- 53. Maximum Subarray
- 53.Maximum Subarray
- [Leetcode] 53. Maximum Subarray
- [leetcode] 53.Maximum Subarray
- 53.Maximum Subarray
- 53. Maximum Subarray
- 【leetcode】53. Maximum Subarray
- [leetcode] 53.Maximum Subarray
- 【leetcode】53. Maximum Subarray
- 53. Maximum Subarray
- redis-cluster通用java接口
- Leetcode Algorithm 070. Climbing Stairs
- 使用js来判断客户端当前网络的状态
- 第四届蓝桥杯第十题连号区间数
- 二二
- 【leedcode】53. Maximum Subarray
- 【Java 5】Unknown column 'user_name' in 'field list'
- AIDL实现Android进程间的通信
- 产品经理之互联网产品-全栈工程师熊盼
- RabbitMQ基础概念详细介绍
- MD5加密的C++实现代码
- NIO实现的简单的客户端与服务端通信(非阻塞)
- ExpandableListView的一些基本语法以及用法,程序员须知的基本标准
- Word Vector