<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 Bucket:
    def __init__(self):
        self.min_element = float('Inf')
        self.max_element = -float('Inf')
        self.empty = True

    def add_num(self, num):
        self.empty = False
        self.min_element = min(self.min_element, num)
        self.max_element = max(self.max_element, num)

class Solution:
    def maximumGap(self, nums: List[int]) -> int:
        if len(nums) <= 1:
            return 0
        
        max_num = max(nums)
        min_num = min(nums)
        bucket_size = (max_num - min_num) // (len(nums) - 1)
        if bucket_size == 0:
            return max_num - min_num
        
        num_buckets = ((max_num - min_num) // bucket_size) + 1
        buckets = [Bucket() for _ in range(num_buckets)]

        for num in nums:
            bucket_index = (num - min_num) // bucket_size
            print(num, bucket_index, num_buckets, bucket_size)
            buckets[bucket_index].add_num(num)
        
        max_gap = 0
        curr_max = None
        for bucket in buckets:
            if bucket.empty:
                continue
            if curr_max is not None:
                max_gap = max(max_gap, bucket.min_element - curr_max)
            curr_max = bucket.max_element

        return max_gap
40598