题解 | #参数解析#
连续子数组的最大和
http://www.nowcoder.com/practice/459bd355da1549fa8a49e350bf3df484
import java.util.*;
public class Solution {
public int FindGreatestSumOfSubArray(int[] array) {
int track = 0;
int output = array[0];
for (int i = 0; i < array.length; i++){
track = Math.max(array[i], track + array[i]);
output = Math.max(output, track);
}
return output;
}
}
，这还是稳定一个月2.5w的前提，草了