LeetCode/solutions/cpp/0219.cpp at master · SnistAheads/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
class Solution {
public:
    bool containsNearbyDuplicate(vector<int>& nums, int k) {
        unordered_set<int> set;

        for (int i = 0; i < nums.size(); i++) {
            if (i > k) set.erase(nums[i - k - 1]);
            if (set.find(nums[i]) != set.end()) return true;
            set.insert(nums[i]);
        }

        return false;
    }
};