MaxGap leetcode题目（桶排序）

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.

思路：采用桶排序，首先遍历数组，找出最大值imax与最小值imin。然后求出(imax-imin)/size作为桶间距distance。然后再遍历数组，将数组元素对disatace求商，作为该元素所对应的桶号。每个桶中存放两个元素：处于桶子范围内的最大值和最小值。最终再遍历桶，求出后一个桶和前一个桶之间的最大差值，返回。注意判断空桶。

代码实现如下，同时打印了排序后桶的状态

#include <iostream>
#include <vector>
#include <algorithm>
#include <stdio.h>
using namespace std;

int maximumGap(vector<int> & source)
{
    int size = source.size();
    if (size < 2)
        return 0;
    if (size == 2)
        return abs(source[0] - source[1]);
    int imin = source[0], imax = source[0];

    //第一次遍历找出最大最小值
    for (int i = 0; i < size; ++i)
    {
        imin = min(imin, source[i]);
        imax = max(imax, source[i]);
    }

    //求出桶子间距
    int distance = (imax - imin) / size + 1;
    vector<vector<int>> bucket((imax - imin) / distance + 1);

    //对桶间距求商作为元素的桶号
    int idx;
    for (int i = 0; i < size; ++i)
    {
        idx = (source[i] - imin) / distance;
        if (bucket[idx].empty())
        {
            bucket[idx].push_back(source[i]);
            bucket[idx].push_back(source[i]);
        }
        else
        {
            bucket[idx][0] = min(bucket[idx][0],source[i]);
            bucket[idx][1] = max(bucket[idx][1],source[i]);
        }
    }

    int gap = 0, pre = 0, tmp;
    for (int i = 1; i < bucket.size(); ++i)
    {
        if (bucket[i].empty()) continue;
        tmp = bucket[i][0] - bucket[pre][1];
        gap = max(gap, tmp);
        pre = i;
    }

    //以下代码为输出桶子状态信息
    cout << "桶号:";
    for (int i = 0; i < bucket.size(); ++i)
    {
        printf("%6d", i);
    }
    cout << endl<<"小值:";
    for (int i = 0; i < bucket.size(); ++i)
    {
        if (!bucket[i].empty())
            printf("%6d", bucket[i][0]);
        else
            cout << "      ";
    }
    cout << endl << "大值:";
    for (int i = 0; i < bucket.size(); ++i)
    {
        if (!bucket[i].empty())
            printf("%6d", bucket[i][1]);
        else
            cout << "      ";
    }
    cout << endl;
    return gap;
}

int main()
{
    //测试用例
    int a[] = {43,2,45,76,49,24,10,34,54,100};
    vector<int> ivec;
    for (int i = 0; i < 10; ++i)
        ivec.push_back(a[i]);
    cout <<"最大间距："<< maximumGap(ivec)<<endl;
}

测试结果