LeetCode 53(Maximum Subarray)Java
来源:互联网 发布:nba2konline刷精华软件 编辑:程序博客网 时间:2024/04/29 09:59
原题:Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
寻找子数组的最大值
思路:对于一个确定的子数组最大值来说,它一定满足:以其开头左边元素为末尾的任何一段子数组的和都小于0;若存在一段大于0的,则最大子数组就可以延长;
所以设置一个变量,用于实时更新数组现在的和,记为sum,当sum小于0时,sum置为0;意为可以舍弃之前的部分,重新开始记录;
代码:
public class Solution { public int maxSubArray(int[] nums) { int res=Integer.MIN_VALUE; int sum=0; for(int i=0;i<nums.length;i++){ if(sum<0){ sum=0; } sum+=nums[i]; res=res>=sum?res:sum; } return res; }}
0 0
- LeetCode 53(Maximum Subarray)Java
- LeetCode(53) Maximum Subarray
- [Leetcode] Maximum Subarray (Java)
- [LeetCode][Java] Maximum Subarray
- [LeetCode]Maximum Subarray(Java)
- LeetCode 53 — Maximum Subarray(C++ Java Python)
- 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
- Leetcode#53 Maximum Subarray
- LeetCode(53) Maximum Subarray
- Leetcode#53||Maximum Subarray
- HDOJ.2091 空心三角形
- EasyIPCamera通过RTSP协议接入海康、大华等摄像机,摒弃私有SDK接入弊端
- Java 异常
- select兼容ie6样式
- 构建高并发高可用的电商平台架构实践
- LeetCode 53(Maximum Subarray)Java
- Git 配置用户名、密码
- ECMAScript6笔记:Proxy和Reflect
- 深刻理解JavaScript基于原型的面向对象
- 算法学习-链表的部分翻转
- Mybatis 的分页插件PageHelper-4.1.1的使用
- [SSM]There is no getter for property named 'token_exptime' in 'class com.hdu.model.Student'
- 1059: [ZJOI2007]矩阵游戏 二分图匹配
- 1662: [Usaco2006 Nov]Round Numbers 圆环数 Time Limit: 5 Sec Memory Limit: 64 MB Submit: 337 Solved: