The maximum-subarray problem
The maximum-subarray problem
public static void main(String[] args) {
int[] A = {13, -3, -25, 20, -3, -16, -23, 18, 20, -7, 12, -5, -22, 15, -4, 7};
int low = 0;
int high = 0;
int sum = A[0...
原创
2020-01-04 18:32:56 ·
133 阅读 ·
0 评论