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.

• Time: O(n)
• Space: O(n)

public boolean containsNearbyAlmostDuplicate_2(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 num = (long) nums[i] - Integer.MIN_VALUE;
        long bucket = num / ((long) t + 1);
        if (map.containsKey(bucket)
        || (map.containsKey(bucket - 1) && num - map.get(bucket - 1) <= t)
        || (map.containsKey(bucket + 1) && map.get(bucket + 1) - num <= t))
            return true;
        if (map.entrySet().size() == k) {
            long last = ((long) nums[i - k] - Integer.MIN_VALUE) / ((long) t + 1);
            map.remove(last);
        }
        map.put(bucket, num);
    }
    return false;
}