LeetCode - Maximum Subarray

发布时间:2017-1-24 15:08:07 编辑:www.fx114.net 分享查询网我要评论
本篇文章主要介绍了"LeetCode - Maximum Subarray",主要涉及到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. class Solution { public: int maxSubArray(int A[], int n) { if(A==NULL||n==0){ return 0; } int max=A[0],tmp=A[0]; for(int i=1;i<n;i++){ if(tmp>0){ tmp+=A[i]; }else{ tmp=A[i]; } max=tmp>max?tmp:max; } return max; } };

下一篇:LINQ体验(4)——LINQ简介和LINQ to SQL语句之Where