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.
Subscribe to see which companies asked this question
这个问题真是流弊啊,绞尽脑汁想到用map。。。最后还是超时了。
public 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]))
map.put(nums[i],i);
else{
if (i - map.get(nums[i]) <= k)
return true;
else{
map.put(nums[i],i);
}
}
}
return false;
}
}
改良后的:
public 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]) && (i - map.get(nums[i])) <= k)
return true;
map.put(nums[i],i);
}
return false;
}
}
其实还是有点不太懂,为什么第一种情况会超时,第二种就不会。 要是有大神看到了,拜托告诉我一下呀!