问题描述:
有一个长为n的数组A,求满足0≤a≤b
import java.util.*;
public class LongestDistance {
public int getDis(int[] A, int n) {
// write code here
int min = 0;
int leftVal = A[0];
for(int i = 0;i<n;i++){
if(A[i]-leftVal > min)
min = A[i]-leftVal;
if(leftVal>A[i])
leftVal = A[i];
}
return min;
}
}