Given an array of integers and an integer k, find out whether there there are two distinct indicesi and j in the array such that nums[i] = nums[j] and the difference betweeni and j is at most k.
题意:给定一个数组和整数k,在数组中查找是否存在两个序号i和j,使nums[i]=nums[j],并且i和j的差最多是k
分类:数组,Hash
解法1:如果两层遍历。时间复杂度是O(n^2),会超时。
和Contains Duplicate类似,我们只遍历一次数组,使用hashMap来记录遍历过的整数,key为这个整数,value为整数所在的序号
如果在遍历过程中发现了重复,比较当前序号和hashmap中的序号,判断差是否小于k,如果是,则返回真,否则继续遍历
public class Solution {
public boolean containsNearbyDuplicate(int[] nums, int k) {
HashMap<Integer,Integer> map =new HashMap<Integer,Integer>();
for(int i = 0;i<nums.length;i++){
if(map.containsKey(nums[i])){
if(i-map.get(nums[i])<=k){
return true;
}else{
map.put(nums[i], i);
}
}else{
map.put(nums[i], i);
}
}
return false;
}
}