LeetCode 0164 - Maximum Gap
Contents
Maximum Gap
Desicription
Given an unsorted array, find the maximum difference between the successive elements in its sorted form.
Return 0 if the array contains less than 2 elements.
Example 1:
1 | Input: [3,6,9,1] |
Example 2:
1 | Input: [10] |
Note:
- You may assume all elements in the array are non-negative integers and fit in the 32-bit signed integer range.
- Try to solve it in linear time/space.
Solution
1 | class Solution { |