Contains Duplicate III

最新推荐文章于 2019-05-01 19:22:10 发布

cgdong2014

最新推荐文章于 2019-05-01 19:22:10 发布

阅读量252

点赞数

CC 4.0 BY-SA版权

分类专栏： Remember Binary Search Tree LeetCode

本文链接：https://blog.youkuaiyun.com/cgdong2014/article/details/47336359

LeetCode 同时被 3 个专栏收录

139 篇文章

订阅专栏

Remember

35 篇文章

订阅专栏

Tree

13 篇文章

订阅专栏

本文介绍了一种使用二叉搜索树解决寻找数组中是否存在两个不同下标的元素，其值之差不大于t且下标之差不大于k的问题的方法。

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.

Show Tags

Show Similar Problems

Have you met this question in a real interview?

思路： Using binary search tree to storage the element.

public class Solution {
    public boolean containsNearbyAlmostDuplicate(int[] nums, int k, int t) {
        TreeSet<Long> set = new TreeSet<>();
        for(int i = 0; i < nums.length; i++) {
            if(i > k) set.remove(Long.valueOf(nums[i - k - 1]));
            long upperBound = (long)nums[i] + t;
            long lowerBound = (long)nums[i] - t;
            Long lower = set.lower(upperBound + 1);
            if(lower != null && lower >= lowerBound) return true;
            set.add(Long.valueOf(nums[i]));
        }
        return false;
    }
}