题目
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.
数组中是否有重复,且两个数组的小标不超过k
算法
set
和217相同,加上一个k窗口
class Solution {
public:
bool containsNearbyDuplicate(vector<int>& nums, int k) {
// set only record k(or less that k) numbers of before nums[i]
set<int> st;
for(int i=0;i<nums.size();++i){
if(st.find(nums[i])!=st.end())
return true;
if(st.size()<k){
st.insert(nums[i]);
}
else{
//insert first,or wrong when k=0
st.insert(nums[i]);
st.erase(nums[i-k]);
}
}
return false;
}
};
算法
hash_map
o(nlgn)
class Solution {
public:
bool containsNearbyDuplicate(vector<int>& nums, int k) {
//map(number,index)
unordered_map<int,int> mp;
for(int i=0;i<nums.size();++i){
if(mp.find(nums[i])!=mp.end() && mp[nums[i]]>=i-k)
return true;
mp[nums[i]]=i;
}
return false;
}
};