题目链接:https://leetcode-cn.com/problems/contains-duplicate-ii/
题目如下:
class Solution {
public boolean containsNearbyDuplicate(int[] nums, int k) {
HashMap<Integer,Integer> hash=new HashMap<Integer,Integer>();
for(int i=0;i<nums.length;i++){
if(hash.containsKey(nums[i])==false) hash.put(nums[i],i);
else {
if(i-hash.get(nums[i])<=k) return true;
else hash.put(nums[i],i);
}
}
return false;
}
}