LeetCode: 164. Maximum Gap

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;
    }
};
全部评论

相关推荐

昨天 19:01
门头沟学院 Java
点赞 评论 收藏
分享
小浪_Coding:找硬件测试,也可兼顾软测欧, 简历还可以的 ,注意排版,项目写的有条理一点, 然后个人技能多加点, 润色好简历之后就开始沟通海投了,深圳,东莞这边做硬件相关的公司还不少, 医疗类,仪器类的都可以尝试
点赞 评论 收藏
分享
评论
点赞
收藏
分享

创作者周榜

更多
牛客网
牛客网在线编程
牛客网题解
牛客企业服务