Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the absolute difference between i and j is at most k.
Example 1:
Input: nums = [1,2,3,1], k = 3 Output: true
Example 2:
Input: nums = [1,0,1,1], k = 1 Output: true
Example 3:
Input: nums = [1,2,3,1,2,3], k = 2 Output: false
这题相对是easy的,做法很简单,维护一个HashMap<Integer(数字), Integer(数字所对应的最近出现的位置)> 顺序遍历数组,如果hash map里面没有当前数字,就直接放进当前为止。如果map里有,就比较当前index和map里面所放的位置,如果位置差小于等于k,直接返回true,否则更新这个数字对应的位置为当前index。数组遍历完就直接返回false就好了
public boolean containsNearbyDuplicate(int[] nums, int k) {
Map<Integer, Integer> indexMap = new HashMap<Integer, Integer>();
for (int i = 0; i < nums.length; i++) {
if (!indexMap.containsKey(nums[i])) {
indexMap.put(nums[i], i);
} else {
if (i - indexMap.get(nums[i]) <= k) {
return true;
} else {
indexMap.put(nums[i], i);
}
}
}
return false;
}