題目:給定一個整數數組,a[1],a[2],…,a[n],每一個元素a[i]可以和它右邊的(a[i+1],a[i+2],…,a[n])元素做差,求這個數組中最大的內插補點,例如a={0,3,9,1,3,5}這個數組最大的內插補點就是9-1=8;
思路1:窮舉,時間複雜度O(n2)
思路2:從右邊開始,逐個找最小值,同時計算內插補點
/**
* Created by Administrator on 2017/9/12.
*/
public class max_differ {
public static void main(String args[]){
int a[] = {,,,,};
int min = Integer.MAX_VALUE;
int max = Integer.MIN_VALUE;
for (int i = a.length-; i > ; i--) {
min = min < a[i] ? min:a[i];
max = max > a[i-] - min ? max:a[i-] - min;
}
System.out.println(max);
}
}