Leetcode 219. Contains Duplicate II

文章作者：Tyan
博客：noahsnail.com  |  CSDN  |  简书

1. Description

2. Solution

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.find(nums[i]) != m.end() && (i - m[nums[i]] <= k)) {
                return true;
            }
            m[nums[i]] = i;
        }
        return false;
    }
};

Reference

1. https://leetcode.com/problems/contains-duplicate-ii/description/