首页 > 代码库 > 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.
动态规划的方法,如果max加上当前元素大于当前元素,则当当前元素加入到数组中时,max的值为当前元素加max。如果小于当前元素,当当前元素加入数组中时的max就是当前元素。
class Solution { public: int maxSubArray(int A[], int n) { if(n == 0) return -1; if(n == 1) return A[0]; int max = A[0]; int res = max; for(int i=1; i<n; i++) { if(max > 0) max = A[i] + max; else max = A[i]; if(max > res) res = max; } return res; } };
LeetCode--Maximum Subarray
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。