#Leetcode# 164. Maximum Gap

https://leetcode.com/problems/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 {
public:
    int maximumGap(vector<int>& nums) {
        int n = nums.size();
        int ans = 0;
        sort(nums.begin(), nums.end());
        for(int i = 0; i < n - 1; i ++) 
            ans = max(ans, nums[i + 1] - nums[i]);
        
        return ans;
    }
};

　　可能是今日最简单的一个 $Hard$ 了吧 从这个题开始试着不要全篇翻译题目了 可能是这个简单吧才看得懂