leetcode -- 53. Maximum Subarray
来源:互联网 发布:js 严格模式 编辑:程序博客网 时间:2024/06/05 12:05
题目
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
.
题意
找出数组中连续子数组(至少包含一个数字)和最大,获得这个和。
代码及分析
- 【递推关系】前 i 个元素,或者与前 i-1个元素中部分相关,或者 只与第 i 个元素有关。(第i个元素一定要作为组成部分,否则不符合连续的要求)
- 【判断条件】前 i-1 个元素的如果小于0,那么对第 i 个元素有降低的作用。
- 【递推公式】
maxSubArray(A, i) = maxSubArray(A, i - 1) > 0 ? maxSubArray(A, i - 1) : 0 + A[i];
- 【参考】DP solution & some thoughts
public int maxSubArray(int[] A) { int n = A.length; int[] dp = new int[n];//dp[i] means the maximum subarray ending with A[i]; dp[0] = A[0]; int max = dp[0]; for(int i = 1; i < n; i++){ dp[i] = A[i] + (dp[i - 1] > 0 ? dp[i - 1] : 0); max = Math.max(max, dp[i]); } return max;}
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
- lambda表达式代替匿名内部类
- LCD的时钟显示
- 基于机器学习技术实现一个医学辅助诊断的专家系统原型
- 题目1486:False coin
- 15.4 处理方法的数据绑定
- leetcode -- 53. Maximum Subarray
- springmvct原理
- bootstrap框架中的data-[ ]自定义属性理解
- Effective前端6:避免页面卡顿
- React Native常用组件样式总结
- 算法学习(三)——选择排序
- C# 在多线程中如何调用Winform
- 指针深入理解
- CSS3 media queries