LeetCode 220. Contains Duplicate III

最新推荐文章于 2024-11-13 11:37:20 发布

USC_ECE

最新推荐文章于 2024-11-13 11:37:20 发布

阅读量75

点赞数

分类专栏： Bit Manipulation and Number 文章标签： leetcode

本文链接：https://blog.csdn.net/qq_31361913/article/details/107592689

版权

Bit Manipulation and Number 专栏收录该内容

16 篇文章 0 订阅

订阅专栏

可以用TreeSet来解决问题，但是为了防止溢出的问题，必须将类型强制转化成long(对应的包装类为Long)。

https://leetcode-cn.com/problems/contains-duplicate-iii/solution/hua-dong-chuang-kou-er-fen-sou-suo-shu-zhao-shang-/

class Solution {
    public boolean containsNearbyAlmostDuplicate(int[] nums, int k, int t) {
        // Corner case
        if(nums == null || nums.length == 0){
            return false;
        }
        TreeSet<Long> set = new TreeSet<>();
        // Sliding window
        for(int i = 0; i < nums.length; i++){
            // Remove the element of which the distance is larger than k
            if(i > k){
                set.remove((long) nums[i - k - 1]);
            }
            // Get the least element which is larger than or equal to the given number
            Long ceiling = set.ceiling((long) nums[i] - t);
            // Be cautious of the condition in which the return value is null
            if(ceiling != null && ceiling <= (long) nums[i] + t){
                return true;
            }
            // Add the curren element into the set
            set.add((long) nums[i]);
        }
        return false;
    }
}