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.
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
这道题与218类似,要注意的是最远距离的理解,即是是否能在长度k之内找到两个相同的数
解法1
HashSet的containKey方法
class Solution {
public boolean containsNearbyDuplicate(int[] nums, int k) {
HashMap<Integer,Integer> map = new HashMap();
for(int i =0;i<nums.length;i++)
{
if(map.containsKey(nums[i])){
int value=map.get(nums[i]);
if(Math.abs(value-i)<=k) return true;
}
map.put(nums[i],i);
}
return false;
}
}
解法2 map的put方法
返回值,如果重复则返回被替换的值否则返回null
class Solution {
public boolean containsNearbyDuplicate(int[] nums, int k) {
HashMap<Integer,Integer> map = new HashMap();
for(int i =0;i<nums.length;i++)
{
Integer value=map.put(nums[i],i);
if(value!=null){
if(i-value<=k)
return true;
}
}
return false;
}
}