leetcode 164. Maximum Gap（最大间距）

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

Return 0 if the array contains less than 2 elements.

Example 1:

Input: [3,6,9,1]
Output: 3
Explanation: The sorted form of the array is [1,3,6,9], either
(3,6) or (6,9) has the maximum difference 3.
Example 2:

Input: [10]
Output: 0
Explanation: The array contains less than 2 elements, therefore return 0.

Note:

You may assume all elements in the array are non-negative integers and fit in the 32-bit signed integer range.
Try to solve it in linear time/space.

给出一个整数数组，求数组排序后的版本中，相邻元素的最大间距。

思路1：
直接排序，然后遍历数组求最大间距，要是按这个思路，那这道题就不是Hard了，虽然题中说要线性复杂度，排序是O(nlogn)，但是用排序写出来可以通过，而且居然超过了92.59%

    public int maximumGap(int[] nums) {
        if(nums == null || nums.length <= 1) {
            return 0;
        }
        
        Arrays.sort(nums);
        int maxGap = 0;
        
        for(int i = 1; i < nums.length; i++) {
            int diff = nums[i] - nums[i - 1];
            maxGap = Math.max(maxGap, diff);
        }
        
        return maxGap;
    }

思路2：
桶排序，待更新