53. Maximum Subarray
来源:互联网 发布:所有足球数据库 编辑:程序博客网 时间:2024/05/16 07:18
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.
Subscribe to see which companies asked this question.
public class Solution { public static int maxSubArray(int[] nums) {int sum = 0;int max_sum = Integer.MIN_VALUE;for (int i = 0; i < nums.length; ++i) {sum += nums[i];sum = sum > nums[i] ? sum : nums[i];max_sum = max_sum > sum ? max_sum : sum;}return max_sum;}}
0 0
- [LeetCode]53.Maximum Subarray
- LeetCode --- 53. Maximum Subarray
- 53.Maximum Subarray
- [Leetcode] 53. Maximum Subarray
- [leetcode] 53.Maximum Subarray
- 53.Maximum Subarray
- 53. Maximum Subarray
- 【leetcode】53. Maximum Subarray
- [leetcode] 53.Maximum Subarray
- 【leetcode】53. Maximum Subarray
- 53. Maximum Subarray
- LeetCode 53. Maximum Subarray
- 53. Maximum Subarray
- [LeetCode]53. Maximum Subarray
- 53. Maximum Subarray LeetCode
- 53. Maximum Subarray
- [LeetCode]53. Maximum Subarray
- 53. Maximum Subarray
- Hibernate 与mybatis的区别
- RxJava 详解
- iOS图像处理(位图图像原图修改)
- 保镖
- 【BZOJ 4561】【JLOI 2016】圆的异或并
- 53. Maximum Subarray
- MyBatis学习 之 三、动态SQL语句
- oracle spatial 增查SQL示例(三 ) 半圆弧和R-tree索引建立
- hadoop之科普篇【hadoop和其他关联项目的关系】
- extjs保存用户习惯(隐藏列)
- 深入springMVC------文件上传源码解析(上篇)
- Maven实践(六)---依赖的坐标和定位
- JIT(准时制生产)
- 软件测试工程师从小白到大牛的发展之路