哈希表:
class Solution {
public:
bool containsNearbyDuplicate(vector<int>& nums, int k) {
unordered_map<int, int> m;
for(int i = 0; i < nums.size(); ++i){
if(m.count(nums[i])){
if(i - m[nums[i]] <= k) return true;
m[nums[i]] = i; //更新靠后的下标
}else m[nums[i]] = i;
}
return false;
}
};
另一种思路,类似滑动窗口:
class Solution {
public:
bool containsNearbyDuplicate(vector<int>& nums, int k) {
unordered_set<int> m;//set来维护窗口
for(int i = 0; i < nums.size(); ++i){
if(m.count(nums[i])) return true;
else{
m.insert(nums[i]);
if(m.size() > k) m.erase(nums[i-k]);
}
}
return false;
}
};