164. Maximum Gap

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.

class Solution:
    def maximumGap(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        try:
            res = 0
            nums.sort()
            for i in range(len(nums)-1):
                res = max(res,nums[i+1]-nums[i])
            return res
        except:
            return 0

好吧，我又暴力了。leetcode真是很不严格呢。
线性方法的话，应该可以考虑计数排序，可以做到时间O(n)和空间O(n)。

164. Maximum Gap

原文：https://www.cnblogs.com/bernieloveslife/p/9739730.html