219. Contains Duplicate II
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.
给定一个整数数组nums与一个整数k,当且仅当存在两个不同的下标i和j满足nums[i] = nums[j]并且|i-j|<=k时返回true,否则返回false。
对nums[0…n-1],存入一个map中,(muns[i], i),如果键nums[k]已经存在,则比较之前的下标和现在的下标的差值,如果差值不大于k,说明到了满足条件的两个值,否则使用新的下标作为值
public boolean containsNearbyDuplicate(int[] nums, int k) {
int len = nums.length;
if (nums == null || len == 0)
return false;
Map<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < len; i++) {
if (map.containsKey(nums[i])) {
if (i - map.get(nums[i]) <= k)
return true;
//如果下标大于k,必须更新,因为之后有可能再次出现此值使下标小于等于k
map.put(nums[i], i);
} else
// 如果没有对应的key添加进去
map.put(nums[i], i);
}
return false;
}