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