【leetcode】【medium】220. Contains Duplicate III

220. Contains Duplicate III

Given an array of integers, find out whether there are two distinct indices i and j in the array such that the absolute difference between nums[i] and nums[j] is at most t and the absolute difference between i and j is at most k.

Example 1:

Input: nums = [1,2,3,1], k = 3, t = 0
Output: true

Example 2:

Input: nums = [1,0,1,1], k = 1, t = 2
Output: true

Example 3:

Input: nums = [1,5,9,1,5,9], k = 2, t = 3
Output: false

题目链接：https://leetcode.com/problems/contains-duplicate-iii/

 

思路：滑动窗口+查找表

此时的set不能再使用unordered_set，因为set使用红黑树（平衡二叉搜索树）实现，对于有顺序的查找更快。

此处使用到了一个STL方法：

ForwardIter lower_bound(ForwardIter first, ForwardIter last,const _Tp& val) 返回一个非递减序列[first, last)中的第一个大于等于值val的位置。

注意：边界int的加减会超出int范围，因此需要使用long long 64位存储。

例如：[-2147483648,-2147483647], 3, 3

class Solution {
public:
    bool containsNearbyAlmostDuplicate(vector<int>& nums, int k, int t) {
        set<long long> record;
        for(int i =0;i<nums.size();++i){
            if(record.lower_bound((long long)nums[i]-(long long)t)!=record.end() 
               && (long long)*record.lower_bound((long long)nums[i]-(long long)t)<=(long long)nums[i]+(long long)t) return true;
            record.insert((long long)nums[i]);
            if(record.size()>k) record.erase(nums[i-k]);
        }
        return false;
    }
};

参考资料

lower_bound、upper_bound：https://blog.csdn.net/u013475704/article/details/46458723