LeetCode: 164. Maximum Gap

最新推荐文章于 2020-08-17 20:53:34 发布

原创最新推荐文章于 2020-08-17 20:53:34 发布 · 216 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

LeetCode 同时被 2 个专栏收录

250 篇文章

订阅专栏

杨领well的 LeetCode 题解专栏

241 篇文章

订阅专栏

本文介绍了解决LeetCode 164. Maximum Gap问题的方法，该问题是寻找未排序数组中排序后相邻元素的最大差距。通过使用C++标准库中的集合(set)，实现了有效的求解算法。

LeetCode: 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.

AC 代码

class Solution {
public:
    int maximumGap(vector<int>& nums) {
        set<int> numset(nums.begin(), nums.end());

        int maxGap = 0;
        int lastNum = 0;
        for(auto iter = numset.begin(); iter != numset.end(); ++iter)
        {
            cout << *iter << endl;
            if(iter == numset.begin())
            {
                lastNum = *iter;
                continue;
            }

            maxGap = max(*iter - lastNum, maxGap);
            lastNum = *iter;
        }

        return maxGap;
    }
};