leetcode 219. Contains Duplicate II

判断数组中是否有两个相等的数，且它们的距离不大于k

自己一开始用队列和哈希表做

class Solution {
public:
    bool containsNearbyDuplicate(vector<int>& nums, int k) {
        if(k <= 0)
            return false;
        if(k >= nums.size())
            k = nums.size();
        map<int, int>mp;
        queue<int> q;
        for(int i = 0; i < k; i++){
            if(!mp.count(nums[i])){
                mp.insert(pair<int, int>(nums[i], 1));
                q.push(nums[i]);
            }
            else
                return true;
        }
        for(int i = k; i < nums.size(); i++){
            if(!mp.count(nums[i])){
                mp.insert(pair<int, int>(nums[i], 1));
                mp.erase(q.front());
                q.pop();
                q.push(nums[i]);
            }
            else
                return true;
        }
        
        return false;
        
    }
};

后来发现别人的简洁做法：

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;
            else m[nums[i]] = i;
        }
        return false;
    }
};