public class Solution {
public int FindGreatestSumOfSubArray(int[] a) {
if(a.length==0)
return 0;
int res=0;
int maxx=-1000000000;
for (int i = 0; i < a.length; i++) {
if(res>=0)
res+=a[i];
else
res=a[i];
if(res>maxx)
maxx=res;
}
return maxx;
}
}
剑指offer - 连续子数组的最大和
最新推荐文章于 2020-11-27 16:48:09 发布