两道编程题 一、求数组在k+1长度的窗口中是否存在相等的值 第一题: class Solution { public boolean containsNearbyDuplic(int[] nums, int k) { int len = nums.length; HashSet<String> memo = new HashSet<>(); for (int i = 0; i < len; i++) { if(i>k){ memo.remove(nums[i-k-1]+","); } if(memo.contains(nums...