leetcode.164. Maximum Gap

最新推荐文章于 2025-05-26 18:28:38 发布

原创最新推荐文章于 2025-05-26 18:28:38 发布 · 302 阅读

0 ·

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

收录于

leetcode

本文介绍了一种用于查找未排序数组中最大相邻元素间隔的线性时间和空间复杂度算法。该算法首先确定数组的最大值和最小值，然后通过合理划分桶的数量来确保每个桶内至少包含一个元素，并利用桶进行快速计算。

Given an unsorted array, find the maximum difference between the successive elements in its sorted form.

Try to solve it in linear time/space.

Return 0 if the array contains less than 2 elements.

You may assume all elements in the array are non-negative integers and fit in the 32-bit signed integer range.

class Solution {
public:
    int maximumGap(vector<int>& nums) {
        if(nums.size()<2)
            return 0;
            
        int maxnum = INT_MIN;
        int minnum = INT_MAX;
        for(int i = 0;i<nums.size();i++)
        {
            maxnum = max(maxnum,nums[i]);
            minnum = min(minnum,nums[i]);
            
        }
        int gapsum = maxnum - minnum;
        int eachlen = gapsum/(nums.size())+1;
        int count = gapsum/eachlen + 1;
        vector<vector<int>> buckets(count); 
        for (int i= 0;i<nums.size();i++) {  
            int j = (nums[i] - minnum) / eachlen;  
            if (buckets[j].empty()) {  
                buckets[j].push_back(nums[i]);  
                buckets[j].push_back(nums[i]);  
            } else {  
                if (nums[i] < buckets[j][0]) buckets[j][0] = nums[i];  
                if (nums[i] > buckets[j][1]) buckets[j][1] = nums[i];  
            }  
        } 
        int gap = 0;
        int prev = 0;  
        for (int i = 1; i < buckets.size(); i++) {  
            if (buckets[i].empty()) continue;  
            gap = max(gap, buckets[i][0] - buckets[prev][1]);  
            prev = i;  
        }  
        return gap; 

        
    }
};