Package g0101_0200.s0164_maximum_gap

Class Solution

java.lang.Object

g0101_0200.s0164_maximum_gap.Solution

public class Solution
extends Object

164 - Maximum Gap.<p>Hard</p> <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><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [3,6,9,1]</p> <p><strong>Output:</strong> 3</p> <p><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.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [10]</p> <p><strong>Output:</strong> 0</p> <p><strong>Explanation:</strong> The array contains less than 2 elements, therefore return 0.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 10⁵</code></li> <li><code>0 <= nums[i] <= 10⁹</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	maximumGap(int[] nums)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

maximumGap

public int maximumGap(int[] nums)