题目
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 difference between i and j is at most k.
给出一个整数数组,找出是否有相同的元素,即nums[i] = nums[j] ;同时两个下标i和j的差值没有超过K,如果存在这样的两个元素,则返回true ;否则返回false;
思路
之前用了两层遍历,时间超时,考虑使用HashMap来解决,用map来存元素和元素出现的位置;注意有可能遍历完,有可能遍历不完
代码
public class Solution {
public static boolean containsNearbyDuplicate(int[] nums, int k) {
Map<Integer, Integer>map=new HashMap<Integer, Integer>();
for (int i = 0; i < nums.length; i++) {
if(map.containsKey(nums[i])&&(i-map.get(nums[i]))<=k)
return true;
map.put(nums[i], i);
}
return false;
}
}