220. Contains Duplicate III

Given an array of integers, find out whether there are two distinct indicesiandjin the array such that the difference betweennums[i]andnums[j]is at mosttand the difference betweeniandjis at mostk.

维护一个windon

treeset：

ceiling(Ee)

Returns the least element in this set greater than or equal to the given element, ornullif there is no such element.

floor(Ee)

Returns the greatest element in this set less than or equal to the given element, ornullif there is no such element.

remove(Objecto)

Removes the specified element from this set if it is present.

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

优质内容筛选与推荐>>
1、網站的性能測試(一)
2、UVa 11100 The Trip, 2007
3、opencv2函数学习之erode、dilate：图像腐蚀和膨胀
4、Kafka-Docker：使用Docker运行Apache Kafka的步骤
5、关于放屁的科学道理

0 │ 收藏 │ 举报

朋友将在看一看看到

分享想法到看一看