<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:
    int maximumGap(vector<int>& nums) {
        if (nums.size() < 2) return 0;
        int max_num = *max_element(nums.begin(), nums.end());
        int exp = 1;
        vector<int> aux(nums.size());
        vector<vector<int>> buckets(10);
        while (max_num / exp > 0) {
            for (auto& bucket : buckets) {
                bucket.clear();
            }
            for (int num : nums) {
                int bucket_index = (num / exp) % 10;
                buckets[bucket_index].push_back(num);
            }
            int index = 0;
            for (const auto& bucket : buckets) {
                for (int num : bucket) {
                    nums[index++] = num;
                }
            }
            exp *= 10;
        }
        int max_gap = 0;
        for (int i = 1; i < nums.size(); i++) {
            max_gap = max(max_gap, nums[i] - nums[i - 1]);
        }
        return max_gap;
    }
};

101109