Leetcode Contains Duplicate III

最新推荐文章于 2020-04-25 23:41:16 发布

每天都要有进步

最新推荐文章于 2020-04-25 23:41:16 发布

阅读量224

点赞数

分类专栏： Leetcode Leetcode 重启

本文链接：https://blog.csdn.net/u011472124/article/details/51990690

版权

Leetcode 同时被 2 个专栏收录

262 篇文章 0 订阅

订阅专栏

Leetcode 重启

149 篇文章 0 订阅

订阅专栏

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] andnums[j] is at most t and the difference between i and j is at most k.

Difficulty: Medium

Solution: TreeSet

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