/**

public boolean containsNearbyAlmostDuplicate(int[] nums, int k, int t) {

TreeSet<Long> set = new TreeSet<>();

for (int i = 0; i < nums.length; ++i) {

long n = nums[i];

Long s = set.ceiling(n);

if (s != null && s <= n + t) return true;

Long g = set.floor(n);

if (g != null && n <= g + t) return true;

set.add(n);

if (set.size() > k) {

set.remove((long) nums[i - k]);

}

}

return false;

}

/**

/**

private long getBucketId(long val, long bucketSize) {

return (val - Integer.MIN_VALUE) / (bucketSize);

}

/**

//[s,s+t+1), [s+t+1,s+2t+2), [s+2t+2,s+3t+3), [s+3t+3,s+4t+4)...

public boolean containsNearbyAlmostDuplicate2(int[] nums, int k, int t) {

if (k < 1 || t < 0) {

return false;

}

Map<Long, Long> map = new HashMap<>();

for (int i = 0; i < nums.length; i++) {

long index = getBucketId(nums[i], (long) t + 1);

if (map.containsKey(index)) {

return true;

}

if (map.containsKey(index - 1) && (long) nums[i] - map.get(index - 1) <= t) {

return true;

}

if (map.containsKey(index + 1) && map.get(index + 1) - (long) nums[i] <= t) {

return true;

}

map.put(index, (long) nums[i]);

if (i >= k) {

index = getBucketId(nums[i - k], (long) t + 1);

map.remove(index);

}

}

return false;

}