leetcode 53. Maximum Subarray
来源:互联网 发布:东莞虎门淘宝摄影 编辑:程序博客网 时间:2024/06/08 04:09
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 Cursum=0;
int Maxsum=nums[0];
for(int i=0;i<nums.size();i++)
{
Cursum+=nums[i];
if(Cursum>Maxsum)
Maxsum=Cursum;
if(Cursum<0)
Cursum=0;
}
return Maxsum;
}
}
思路:
线性时间算法, 该算法在每次元素累加和小于0时,从下一个元素重新开始累加。cursum表示如果前面的和小于零,后面的这个数肯定不会和前面相加,所以将其置零继续循环。
阅读全文
0 0
- [LeetCode]53.Maximum Subarray
- LeetCode --- 53. Maximum Subarray
- [Leetcode] 53. Maximum Subarray
- [leetcode] 53.Maximum Subarray
- 【leetcode】53. Maximum Subarray
- [leetcode] 53.Maximum Subarray
- 【leetcode】53. Maximum Subarray
- LeetCode 53. Maximum Subarray
- [LeetCode]53. Maximum Subarray
- 53. Maximum Subarray LeetCode
- [LeetCode]53. Maximum Subarray
- leetcode 53. Maximum Subarray
- [leetcode] 53. Maximum Subarray
- LeetCode *** 53. Maximum Subarray
- 【LeetCode】53. Maximum Subarray
- leetcode 53. Maximum Subarray
- LeetCode 53. Maximum Subarray
- Leetcode:53. Maximum Subarray
- 数据结构实验报告(四)
- 4用于cifar10的卷积神经网络-4.8/4.9为cifar10卷积网络添加汇总操作上/下
- 利用python进行数据分析学习笔记-Pandas篇
- Struts 多个文件,拦截器,文件上传
- 【学习笔记】设计模式-适配器模式
- leetcode 53. Maximum Subarray
- Java与CSP数据兼容之三:Java兼容CSP的DES/3DES密钥数据和密文
- response重定向的网址中有中文乱码的解决办法
- linux regular expression
- 【JQuery学习笔记三】JQuery学习总结
- Quartz定时任务(附demo)(一)
- git checkout
- NOIP 2017 小凯的疑惑 (数学)
- 产品的一点思考