Maximum Gap Leetcode #164 题解[Python]

题目来源

---

https://leetcode.com/problems/maximum-gap/description/

题意分析

---

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:

Input: [3,6,9,1]
Output: 3
Explanation: The sorted form of the array is [1,3,6,9], either
(3,6) or (6,9) has the maximum difference 3.

Example 2:

Input: [10]
Output: 0
Explanation: The array contains less than 2 elements, therefore return 0.

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.

给出一个乱序数组, 求出排序后连续的两个元素间最大差值, 这个差值即是所谓的MaxGap.

元素少于2返回0
尝试在线性空间\时间内解决.

解题思路

---

这题坦白来讲其实相当的有难度. 博主想了挺久也没有想出可行的线性解.

后来看了讨论区, 原来这道题用桶排序变形一下就好了.

首先, 对一个数组来说, 肯定会有这个公式成立: