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.

分析：

要求采用线性时间，可以使用的线性排序算法包括基数排序、桶排序等，这里采用桶排序。

class Solution {
public:
    int maximumGap(vector<int>& nums) {
        int n=nums.size();
        if(n<2) return 0;
        int maxval=nums[0],minval=nums[0];
        for(int i=1;i<n;++i)
        {
            maxval=max(maxval,nums[i]);
            minval=min(minval,nums[i]);
        }
        int dif = maxval-minval;
        int cap = dif/n+1;
        vector<vector<int>> bucket(dif/cap+1);
        for(int i=0;i<n;++i)
        {
            int idx = (nums[i]-minval)/cap;
            if(bucket[idx].empty())
            {
                bucket[idx].push_back(nums[i]);
                bucket[idx].push_back(nums[i]);
            }
            else
            {
                bucket[idx][0]=min(bucket[idx][0],nums[i]);
                bucket[idx][1]=max(bucket[idx][1],nums[i]);
            }
        }
        int val=bucket[0][1],res=0;
        for(int i=1;i<dif/cap+1;++i)
            if(!bucket[i].empty())
            {
                res = max(res,bucket[i][0]-val);
                val=bucket[i][1];
            }
                
        return res;
    }
};