算法——O(n)解决无序数组排序后的相邻最大差值

int find_Max_Offset(int *a,int length) {
    int min = getMin(a, length), max = getMax(a, length);
    if (max == min) return 0;
    int **bucket = new int*[length + 1];
    for (int i = 0; i < length + 1; i++) {
        bucket[i] = new int[3]; 
        bucket[i][0] = 0;
    }
    
    bucket[0][0] = 1;
    bucket[0][1] = bucket[0][2] = min;
    bucket[length][0] = 1;
    bucket[length][1] = bucket[length][2] = max;
    for (int i = 1; i < length; i++) {
        int index = ( a[i] - min) * length / (max - min);
        if (!bucket[index][0]) {
            bucket[index][0] = 1;
            bucket[index][1] = a[i];
            bucket[index][2] = a[i];
        }
        else {
            bucket[index][1] = a[i] > bucket[index][1] ? a[i] : bucket[index][1];
            bucket[index][2] = a[i] < bucket[index][2] ? a[i] : bucket[index][2];
        }
     }

    int offset = 0;
    for (int i = 0; i < length; i++) {
        int max = bucket[i++][1];
        while (bucket[i][0] == 0) i++;
        int min = bucket[i][2];
        offset = (min - max) > offset ? (min - max) : offset;
    }
    return offset;
}