2022.1.19-----leetcode.219

 public static boolean containsNearbyDuplicate(int[] nums, int k) {
        HashMap<Integer,Integer> hash=new HashMap<>();//哈希表存储数字及其索引
        //遍历数组，判断当前数字与哈希表中相同数字索引之差是否满足条件
        for (int i = 0; i < nums.length; i++) {
            if(hash.containsKey(nums[i])&&i-hash.get(nums[i])<=k)
            {
                return true;
            }
            else
            {
                hash.put(nums[i],i);//更新哈希表
            }


        }
        return false;

    }