Dynamic Programming:53. Maximum Subarray
来源:互联网 发布:java导入进度条 编辑:程序博客网 时间:2024/06/15 13:17
建立一个数组numsres,和array一样长,每一个位置i存放的是包括array[i]在内的最大的连续子数组的和。这样,如果numsres[i-1]小于0,说明numsres[i]就等于array[i]。否则numsres[i]就是numsres[i-1]+array[i]。贴上我的代码:
class Solution {public: int maxSubArray(vector<int>& nums) { vector<int> numsres(nums.size()); numsres[0] = nums[0]; int max = numsres[0]; for(int i = 1; i < nums.size(); ++i) { if(numsres[i - 1] < 0) { numsres[i] = nums[i]; } else { numsres[i] = numsres[i - 1] + nums[i]; } if(numsres[i] > max) max = numsres[i]; } return max; }};
阅读全文
0 0
- Dynamic Programming:53. Maximum Subarray
- LeetCode 53. Maximum Subarray(dynamic programming)
- leetCode刷题归纳-Dynamic Programming(53. Maximum Subarray&& 152. Maximum Product Subarray)
- implement the maximum subarray using dynamic programming
- LeetCode[Dynamic Programming]: Maximum Product Subarray
- 152. Maximum Product Subarray dynamic programming
- [week 8][Leetcode][Dynamic Programming] Maximum Subarray
- (M)Dynamic Programming:152. Maximum Product Subarray
- ※ Leetcode - Dynamic Programming - 53.Maximum Subarray(最大连续和)+152.Maximum Product Subarray(最大连续积)
- [Leetcode刷题总结系列][Dynamic programming][Divide-and-conquer]53.Maximum Subarray
- LeetCode-Easy部分中标签为 Dynamic Programming(DP) 53. Maximum Subarray
- week14- Dynamic Programming-NO.152. Maximum Product Subarray
- LeetCode: -Dynamic Programming-Maximum Subarray[53]-子数组最大和
- LeetCode: -Dynamic Programming-Continuous Subarray Sum[523]
- (M)Dynamic Programming:523. Continuous Subarray Sum
- Dynamic Programming | Set 36 (Maximum Product Cutting)
- [LeetCode]53.Maximum Subarray
- LeetCode --- 53. Maximum Subarray
- Count of Smaller Numbers After Self
- Shiro servlet启动报错 Failed to initialize component [org.apache.catalina.webresources.JarResource@xxxx
- 1022 Train Problem I 栈的简单应用
- hdu 1501(dp)
- msi台式机BIOS中选择引导方式启动Windows或者Ubuntu
- Dynamic Programming:53. Maximum Subarray
- 博弈论
- L1-039. 古风排版
- jQuery常用技巧及常用方法列表集合
- bzoj4518 [Sdoi2016]征途(斜率优化dp)
- 数据库函数总结(Oracle篇二)
- Roman to Integer
- bzoj1031: [JSOI2007]字符加密Cipher(后缀数组)
- python字典快速保存于读取