示例 1：
输入：nums = [1,2,3,1], k = 3, t = 0输出：true

public class DayCode {    public static void main(String[] args) {        int[] nums = new int[]{1, 2, 3, 1};        int k = 3, t = 0;
        boolean ans = new DayCode().containsNearbyAlmostDuplicate(nums, k, t);        System.out.println("ans is " + ans);    }
    /**     *     * @param nums     * @param k     * @param t     * @return     */    public boolean containsNearbyAlmostDuplicate(int[] nums, int k, int t) {        int n = nums.length;        TreeSet<Long> treeSet = new TreeSet<>();        for (int i = 0; i < n; i++) {            Long u = nums[i] * 1L;            Long l = treeSet.floor(u);            Long r = treeSet.ceiling(u);            if (l != null && u - l <= t) {                return true;            }            if (r != null && r - u <= t) {                return true;            }            treeSet.add(u);            if (i >= k) {                treeSet.remove(nums[i - k] * 1L);            }        }
        return false;    }}

A NavigableSet implementation based on a TreeMap. The elements are ordered using their natural ordering, or by a Comparator provided at set creation time, depending on which constructor is used.This implementation provides guaranteed log(n) time cost for the basic operations (add, remove and contains).