<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 radixSort(const int& n, vector<int>& nums, vector<int>& output, int k) {
        int count[10] = {0};
        for (auto& x : nums) {
            count[(x/k) % 10]++;
        }
        for (int i=1; i<10; i++) {
            count[i] += count[i-1];
        }
        for (int i=n-1; i>=0; i--) {
            int d = (nums[i]/k)%10;
            output[count[d]-1] = nums[i];
            count[d]--;
        }
        for (int i=0; i<n; i++) {
            nums[i] = output[i];
        }
    }
    int maximumGap(vector<int>& nums) {
        int mini = INT_MAX, maxi = 0;
        for (auto& x : nums) {
            mini = min(mini, x);
            maxi = max(maxi, x);
        }
        if (mini == maxi) return 0;

        const int n = nums.size();
        vector<int> temp(n,0);
        for (int k=1; maxi /k != 0; k*=10) {
            radixSort(n, nums, temp, k);
        }
        int ans = 0;
        for (int i=1; i<n; i++) {
            ans = max(ans, nums[i] - nums[i-1]);
        }
        return ans;
    }
};

auto boom = [](){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    return 0;
}();
87661