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.
和http://www.jianshu.com/p/993639a376f0 差不多多了一个条件。
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 pos = map.get(nums[i]);
if(i-pos<=k)
return true;
}
map.put(nums[i],i);
}
return false ;
}
}
