[LeetCode] Maximum Subarray
来源:互联网 发布:优化网络连接 编辑:程序博客网 时间:2024/05/29 11:19
原题地址: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.
经典的动态规划题,设 0 到 i 的连续字串最大和为sum[i],以 i 结束的连续子串最大和为 endSum[i],显然 sum[i] = max{endSum[i] + arr[i],sum[i - 1]},而 endSum[i] = max{endSum[i - 1], arr[i]}
public class Solution { public int maxSubArray(int[] A) { if (A == null || A.length < 1) { return 0; } int endSum = Integer.MIN_VALUE; int subSum = Integer.MIN_VALUE; for (int i = 0; i < A.length; i++) { // update endSum endSum = endSum > 0 ? endSum + A[i] : A[i]; subSum = endSum > subSum ? endSum : subSum; } return subSum; }}
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
- UVA - 531Compromise(LIS)
- 全排列 与m中挑出n个数
- strom中worker、task、spout/bolt、executor、component的关系
- 谈谈我的一些面试经历,主要大公司,小公司就没多大意义
- Google后Hadoop时代的新“三驾马车”——Caffeine、Pregel、Dremel&Google Dremel 原理 – 如何能3秒分析1PB
- [LeetCode] Maximum Subarray
- DSP开发视频教程
- nginx初识
- docker 实战---部署tomcat\weblogic集群 (二)
- PE文件格式分析及修改
- android gdbserver
- ECSHOP首页显示商品销量
- C语言结构体里的成员数组和指针
- mariadb-入门