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

相关推荐

07-23 14:04
东北大学 C++
既然这样,为什么不点击就送呢
牛马88号:因为你合适。但有很多笔试就挂了、通过了再排序的
点赞 评论 收藏
分享
07-07 12:47
门头沟学院 Java
码农索隆:竟然还真有卡体检报告的
点赞 评论 收藏
分享
评论
点赞
收藏
分享

创作者周榜

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