【LeetCode】53. Maximum Subarray
来源:互联网 发布:网络安全法宣传 编辑:程序博客网 时间:2024/05/01 02:38
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.
- Difficulty: Medium
动态规划
另sum[i]表示从i开始的最大子串和,则有递推公式:sum[i] = max{A[i], A[i] + sum[i+1]}
因为递推式只用到了后一项,所以在编码实现的时候可以进行状态压缩,用一个变量即可
class Solution {public: int maxSubArray(vector<int>& nums) { int n=nums.size(); int sum = nums[n - 1]; int maxSum = sum; for (int i = n - 2; i >= 0; i--) { sum = max(nums[i], sum + nums[i]); maxSum = max(maxSum, sum); } return maxSum; }};
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
- 怎么用 Stylish 排除某几类网址
- 说话人识别ALIZE工具包的编译
- Android launchMode的使用
- Python程序-离散和线性图形
- Python AttributeError: 'module' object has no attribute xxxx
- 【LeetCode】53. Maximum Subarray
- mircosoft sql server 2012 单表超过255字段导出
- Spring MVC 自学杂记(二) -- 数据绑定之日期转换
- had
- Java入门第三季(一、异常与异常处理)
- JDBC与JNDI
- Linux使用的一些技巧
- [bigdata-025] ubuntu 14.04 下用virtualbox安装ghost xp
- FlowDocument 动态加载并显示Xaml