首页 > 代码库 > [Leetcode] Maximum Subarray
[Leetcode] 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.
More practice:
If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.
Solution: dp
1 public class Solution { 2 public int maxSubArray(int[] A) { 3 int sum=0; 4 int max=Integer.MIN_VALUE; 5 for(int i=0;i<A.length;++i){ 6 sum+=A[i]; 7 if(sum>=max) 8 max=sum; 9 if(sum<0)10 sum=0;11 }12 return max; 13 }14 }
[Leetcode] Maximum Subarray
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。