[LeetCode 220] Contains Duplicate III

本文介绍了一种在整数数组中查找是否存在两个不同索引i和j,使得nums[i]和nums[j]之间的差小于等于t,且i和j之间的差小于等于k的方法。采用TreeSet实现滑动窗口,确保窗口大小始终不超过k,并通过比较窗口内的元素来判断是否存在满足条件的两个数。

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

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

solution:

first thought to use window, size is k, the window stores k elements in order. every time only need to compare two smallest number in this window to see if difference smaller than t. But we also need to consider the bigger number in the window.

 public boolean containsNearbyAlmostDuplicate(int[] nums, int k, int t) {
        if(k<1 || t<0 || nums == null || nums.length == 0) return false;
        int len = nums.length;
        SortedSet<Long> window = new TreeSet<Long>();
        for(int i=0;i<len;i++){
            SortedSet<Long> subset = window.subSet((long)nums[i]-t, (long)nums[i]+t+1);
            if(!subset.isEmpty()) return true;
            if(i>=k) window.remove((long)nums[i-k]);
            window.add((long)nums[i]);
        }
        return false;
    }

O(n log(k)). There should be O(n) solution.



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值