1
2
3
4
5
6
7
8
9
10
11
12
13
| class Solution {
public boolean containsNearbyDuplicate(int[] nums, int k) {
Map<Integer, Integer> visited = new HashMap<>();
for (int i = 0; i < nums.length; i++) {
if (visited.containsKey(nums[i]) && i - visited.get(nums[i]) <= k) {
return true;
} else {
visited.put(nums[i], i);
}
}
return false;
}
}
|
