[leetcode]220. Contains Duplicate III

最新推荐文章于 2024-10-16 14:07:42 发布

xiaocong1990

最新推荐文章于 2024-10-16 14:07:42 发布

阅读量336

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 其它（重要）

本文链接：https://blog.youkuaiyun.com/xiaocong1990/article/details/72598002

leetcode 同时被 2 个专栏收录

473 篇文章

订阅专栏

其它（重要）

168 篇文章

订阅专栏

本文介绍了一种解决LeetCode上含有重复项III问题的方法，该问题要求在给定的整数数组中寻找两个元素之间的绝对差不超过t且下标之差不超过k的情况。通过使用有序集合维护一个滑动窗口，有效地解决了这一问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

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.

class Solution {
public:
    bool containsNearbyAlmostDuplicate(vector<int>& nums, int k, int t) {
        long long t_long=t;
        set<long long> window; // set is ordered automatically
        for (int i = 0; i < nums.size(); i++) {
            if (i > k) window.erase((long long)nums[i-k-1]); // keep the set contains nums i j at most k
            // |x - nums[i]| <= t  ==> -t <= x - nums[i] <= t;
            // x-nums[i] >= -t ==> x >= nums[i]-t
            auto pos = window.lower_bound((long long)(nums[i] - t_long)); 
            // x - nums[i] <= t ==> x  <= t+nums[i]
            if (pos != window.end() && *pos <= (long long)(t_long+nums[i])) return true;
            window.insert((long long)nums[i]);
        }
        return false;
    }
};