package LeetCode;

import java.util.TreeSet;

public class LeetCode220 {

    // 220. Contains Duplicate III
    // https://leetcode.com/problems/contains-duplicate-iii/description/
    // : O(nlogk)
    // : O(k)

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

        // int
        // long long
        TreeSet record = new TreeSet();

        // nums = [1,2,3,1], k = 3, t = 0  true
        // nums = [1,5,9,1,5,9], k = 2, t = 3 false

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

            // ceiling ,ceilingset--->null
            if (record.ceiling((long) nums[i] - (long) t) != null &&
                    record.ceiling((long) nums[i] - (long) t)