题解 | #连续子数组的最大和#
连续子数组的最大和
http://www.nowcoder.com/practice/459bd355da1549fa8a49e350bf3df484
public class Solution {
public int FindGreatestSumOfSubArray(int[] array) {
int n = array.length;
int max = array[0];
int sum = array[0];
for(int i = 1; i < n; i++){
if(sum <= 0) sum = 0;
sum += array[i];
if(sum > max) max = sum;
}
return max;
}
}
查看15道真题和解析
