LeetCode-Maximum Subarray
来源:互联网 发布:唱歌好听的网络女主播 编辑:程序博客网 时间:2024/05/05 21:42
题目:https://oj.leetcode.com/problems/maximum-subarray/
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.
分析:经典题,见《编程之美》源码:Java版本
算法分析:时间复杂度O(n),空间复杂度O(1)
public class Solution { public int maxSubArray(int[] A) { if(A==null || A.length==0) { return 0; } int n=A.length; int maxStart=A[n-1]; int maxValue=A[n-1]; for(int i=n-2;i>=0;i--) { maxStart=Math.max(A[i],A[i]+maxStart); maxValue=Math.max(maxStart,maxValue); } return maxValue; }}
0 0
- 【LeetCode】Maximum Subarray 和 Maximum Product Subarray
- LeetCode: Maximum Subarray
- LeetCode Maximum Subarray
- [Leetcode] Maximum Subarray
- LeetCode: Maximum Subarray
- leetcode 25: Maximum Subarray
- [LeetCode] Maximum Subarray
- [Leetcode] Maximum Subarray
- [LeetCode]Maximum Subarray
- [leetcode]Maximum Subarray
- LeetCode-Maximum Subarray
- [leetcode] Maximum Subarray
- LeetCode 45: Maximum Subarray
- LeetCode - Maximum Subarray
- LeetCode:Maximum Subarray
- LeetCode 53: Maximum Subarray
- 【leetcode】Maximum Subarray
- Leetcode Maximum Subarray
- 探讨一下如何学好C#
- sdasdsdas
- C语言总结2
- poj3616 Milking Time
- 关于VS2008问题“无法找到“XXX.exe”的调试信息,或者调试信息不匹配。未使用调试信息生成二进制文件。“
- LeetCode-Maximum Subarray
- au3宏指令参考 - 完整宏指令列表
- 杭电 Big Number
- Sorting a 2d array in ruby
- hibernate的映射:一对多关联关系
- 选择适合自己的流产方式
- CUDA常量内存
- Android导入一个工程时提示 Invalid project description的解决方法
- linux检测网线插拔状态