LeetCode 220 Contains Duplicate III

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.

注意sortedset的应用。参考：点击打开链接

public boolean containsNearbyAlmostDuplicate(int[] nums, int k, int t) {
if (k < 1 || t < 0) return false;
SortedSet<Long> set = new TreeSet<Long>();
for (int i = 0; i < nums.length; i++) {
if (!set.subSet((long) nums[i] - t, (long) nums[i] + t + 1).isEmpty()) return true;
if (i >= k) set.remove((long) nums[i - k]);
set.add((long) nums[i]);
}
return false;
}