ARTS打卡 day 1

最新推荐文章于 2023-08-25 16:45:50 发布

runningkid

最新推荐文章于 2023-08-25 16:45:50 发布

阅读量135

点赞数

分类专栏：打卡文章标签： ARTS打卡

本文链接：https://blog.csdn.net/runningkid/article/details/103324560

版权

打卡专栏收录该内容

1 篇文章 0 订阅

订阅专栏

Algorithm

leetcode 220 contains deplicate 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.

TreeSet is a dynamic data structure that supports faster insert, search and delete. Self-balancing Binary Search Tree (BST) is the right data structure. The term Self-balancing means the tree automatically keeps its height small after arbitrary insert and delete operations. Why does self-balancing matter? That is because most operations on a BST take time directly proportional to the height of the tree.

public class Solution {
    public boolean containsNearbyAlmostDuplicate(int[] nums, int k, int t) {
        TreeSet<Integer> set = new TreeSet<>();
        for (int i = 0; i < nums.length; i++) {
            Integer s = set.ceiling(nums[i]);
            if (s != null && s <= nums[i] + t) return true;
            Integer g = set.floor(nums[i]);
            if (g != null && nums[i] <= g + t) return true;
            set.add(nums[i]);
            if (i >= k) {
                set.remove(nums[i - k]);
            }
        }
        return false;
    }
}