164. Maximum Gap

標籤：elements   form   elf   時間   time   xpl   bit   may   lis   

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