【LeetCode解题报告】164. Maximum Gap

题目来源：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.

题意分析：

      给定一个无序数组，求有序情况下相邻元素差最大为多少。

思路分析：

       这里给出一个简单的办法，即先给该无序数组进行排序，然后遍历其中相邻两个元素的差值，找出最大值返回即可。

代码：

class Solution(object):
    def maximumGap(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        nums = sorted(nums)
        maxGap = 0
        for x in range(len(nums) - 1):
            maxGap = max(maxGap, nums[x + 1] - nums[x])
        return maxGap