Leetcode Maximum gap

Given an unsorted array, find the maximum difference between the successive elements in its sorted form.

Try to solve it in linear time/space.

Return 0 if the array contains less than 2 elements.

You may assume all elements in the array are non-negative integers and fit in the 32-bit signed integer range.

---

O(n)时间的sort 算法就是bucket sort了.
但是如果create一个size和range一样大的数组，太浪费空间.
已知range=max-min+1, 一共有n个数, 那么 gap的最大值一定大于等于 Math.ceil( range/(n-1) ) -1, 所以只需要分配 n-1个 buckets，每个覆盖gap+1的长度，只记录每个bucket的local min, local max, 然后遍历一遍用min[i+1]-max[i-1]算出最大gap

[code]

public class Solution {
    public int maximumGap(int[] num) {
        if(num==null || num.length<2)return 0;
        if(num.length==2)return Math.abs(num[0]-num[1]);
        int min=num[0], max=num[0], n=num.length;
        for(int i=1;i<num.length;i++)
        {
            min=Math.min(min, num[i]);
            max=Math.max(max, num[i]);
        }
        int len=(int)Math.ceil((double)(max-min+1)/(double)(n-1));
        int buckets[][]=new int[n-1][2];
        for(int i=0;i<buckets.length;i++)Arrays.fill(buckets[i],-1);
        int gap=len-1;
        for(int i=0;i<n;i++)
        {
            int index=(num[i]-min)/len;
            buckets[index][0]=buckets[index][0]==-1 ? num[i] : Math.min(num[i],buckets[index][0]);
            buckets[index][1]=buckets[index][1]==-1 ? num[i] : Math.max(num[i],buckets[index][1]);
        }

        int i=0, previous=-1;
        while(i<buckets.length)
        {
            while(i<buckets.length && buckets[i][0]==-1)i++;
            if(i==buckets.length)break;
            if(previous==-1)previous=buckets[i][1];
            else
            {
                gap=Math.max(gap, buckets[i][0]-previous);
                previous=buckets[i][1];
            }
            i++;
        }
        return gap;
    }
}