程式語言 - LeetCode - C++ - 219. Contains Duplicate II



參考資訊:
https://www.cnblogs.com/grandyang/p/4539680.html

題目:


解答:

class Solution {
public:
    bool containsNearbyDuplicate(vector<int>& nums, int k) {
        int n = nums.size();
        unordered_map<int, int> q;

        for (int i = 0; i < n; ++i) {
            if (q.count(nums[i]) && i - q[nums[i]] <= k) {
                return true;
            }
            q[nums[i]] = i;
        }

        return false;
    }
};