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) {
        if (nums.size() < 2) return 0;
        int ret = 0;
        int min = *min_element(nums.begin(), nums.end());
        int max = *max_element(nums.begin(), nums.end());
        if (max - min <= 1) return (max - min);
        
        int n = (int)nums.size(), bi;
        vector<int>bl(n, INT_MAX), bh(n, INT_MIN);  //记录桶中元素的最大值和最小值
        for (int i = 0; i < n; i++) {
            bi = 1.0 * (nums[i] - min)/(max - min) * (n - 1);  //nums[i]所在bucket索引
            bl[bi] = std::min(nums[i], bl[bi]);
            bh[bi] = std::max(nums[i], bh[bi]);
        }
        int pre = bh[0];
        for (int i = 1; i < n; i++) {
            if (bl[i] != INT_MAX) {  //bucket not emtpy
                ret = std::max(bl[i] - pre, ret);
                pre = bh[i];
            }
        }
        return ret;
    }  
};