排序邻数差值

发表于 | 分类于 ，

简述

求数组排序后相邻数的最大差值 

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
public static int maxGap(int[] arr){
    if(arr == null || arr.length == 0){
        return 0;
    }
    int len = arr.length;
    int max = Integer.MIN_VALUE;
    int min = Integer.MAX_VALUE;
    for(int i = 0; i  <len; i++){
        max = Math.max(arr[i], max);
        min = Math.min(arr[i], min);
    }
    if(max == min){
        return 0;
    }
    int[] maxArr = new int[len+1];
    int[] minArr = new int[len+1];
    boolean[] hasNum = new boolean[len + 1];
    int k = 0;
    for(int i = 0; i < len; i++){
        k = getBucket(arr[i], max, min, len);
        maxArr[k] = hasNum[k] ? Math.max(arr[i], maxArr[k]) : arr[i];
        minArr[k] = hasNum[k] ? Math.min(arr[i], minArr[k]) : arr[i];
        hasNum[k] = true;
    }
    int lastMax = 0;
    int nextMin = 0;
    int i = 0;
    for(; i<len; i++){
        if(!hasNum[i]){
            lastMax = maxArr[i-1];
            break;
        }
    }
    while(i<len+1){
        if(hasNum[i]){
            nextMin = minArr[i];
            break;
        }
        i++;
    }
    return nextMin - lastMax;
}
/**
 * 计算进入哪个桶  max直接放入n+1桶中 
 */
public static int getBucket(int num, int max, int min, int len){
    return ((num - min) * len) / (max - min);
}