<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:
    def maximumGap(self, nums: List[int]) -> int:
        if len(nums)<2:
            return 0
        def merge(nums):
            if len(nums) > 1:
                mid=len(nums)//2
                l=nums[:mid]
                r=nums[mid:]
                merge(l)
                merge(r)
                n,m,k=0,0,0
                
                while n<len(l) and m<len(r):
                    if l[n]<r[m]:
                        nums[k]=l[n]
                        
                        n+=1
                    else:
                        nums[k]=r[m]
                        m+=1
                   
                    k+=1
                while n<len(l):
                    nums[k]=l[n]
                    n+=1
                    
                    k+=1
                
                while m<len(r):
                    nums[k]=r[m]
                    m+=1
                   
                    k+=1
                    
        ma=0
        merge(nums)
        for i in range(1,len(nums)):
            ma=max(ma,nums[i]-nums[i-1])
        return ma
            



26903