public class tmp {
public static void main(String[] args) {
int[] a = { 6, -3, -2, 7, -15, 1, 2, 2 };
System.out.println(FindGreatestSumOfSubArray(a));
}
public static int FindGreatestSumOfSubArray(int[] array) {
int len = array.length;
if(len==0)return 0;
int max = array[0];
for (int i = 1; i < len; i++) {
if (array[i - 1] + array[i] > array[i])
array[i] += array[i - 1];
if (array[i] > max)
max = array[i];
}
return max;
}
}
连续子数组最大和
最新推荐文章于 2023-08-17 23:09:45 发布