lc_219

https://leetcode.cn/problems/contains-duplicate-ii/标签滑动窗口unordered_set(无序、去重代码初始版bool containsNearbyDuplicate(vectorint nums, int k) { unordered_setints; int tnums.size(); if(t1){return false;} for(int i0; imin(k,t-1); i){ if(s.find(nums[i])s.end()){ s.insert(nums[i]); } else{ return true; } } for(int i0,jk1;jt;j){ s.erase(nums[i]); if(s.find(nums[j])s.end()){ s.insert(nums[j]); } else{ return true; } } return false; }简洁版bool containsNearbyDuplicate(vectorint nums, int k) { int tnums.size(); unordered_setints; for(int i0; it; i){ if(s.count(nums[i])s.size()k){return true;} if(s.size()k1){ s.erase(nums[i-k-1]); } if(s.count(nums[i])){return true;} s.insert(nums[i]); } return false; }复杂度 On