<p>Given an integer array <code>nums</code>, return <em>the maximum difference between two successive elements in its sorted form</em>. If the array contains less than two elements, return <code>0</code>.</p>

<p>You must write an algorithm that runs in linear time and uses linear extra space.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [3,6,9,1]
<strong>Output:</strong> 3
<strong>Explanation:</strong> The sorted form of the array is [1,3,6,9], either (3,6) or (6,9) has the maximum difference 3.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [10]
<strong>Output:</strong> 0
<strong>Explanation:</strong> The array contains less than 2 elements, therefore return 0.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>0 &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
</ul>

class Solution {
public:

    void bucketSort(vector<int>& nums) {
        int base = 10;
        int d = 1;
        vector<vector<int>> buckets(base);
        int N = nums.size();
        while (true){
            for (int i = 0; i < N; ++i){
                int e = nums[i];
                int bucket_i = (e/d)%base;
                buckets[bucket_i].push_back(e);
            }
            // Refill nums with the numbers sorted in the current radix order
            // Should use std::copy but want to get it done for now
            int i = 0;
            bool done = true;
            for (auto& bucket : buckets)
            {
                for (auto e : bucket)
                {
                    nums[i] = e;
                    if (e/d > 0)
                    {
                        done = false;
                    }
                    ++i;
                }
                bucket.resize(0);
            }
            if (done)
            {
                break;
            }
            d *= base;
        }
    }

    int maximumGap(vector<int>& nums) {
        int diff = 0;
        if (nums.size() > 1){
            bucketSort(nums);
            diff = nums[1] - nums[0];
            for (auto i = 2; i < nums.size(); ++i){
                auto curr_diff = nums[i] - nums[i-1]; 
                diff = (curr_diff > diff) ? curr_diff : diff; 
            }
        }
        return diff;
    }
};
102331