219. Contains Duplicate II

Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the absolute difference between i and j is at most k.

本题可用滑动窗口解决，需要注意维护滑动窗口，满足条件则纳入元素，不满足条件则从滑窗开始地方删除元素，解题代码如下：

#include <iostream>
#include <vector>
#include <unordered_set>

using namespace std;

// 滑动窗口
class Solution {
public:
    bool containsNearbyDuplicate(vector<int>& nums, int k) {

        unordered_set<int> record;
        // 考察子串(i-k..i]
        for (int i = 0; i < nums.size(); i++){

            // 考察当前
            if (record.find(nums[i]) != record.end())
                return true;

            // 纳入子串中
            record.insert(nums[i]);

            // 如果长度超过了就，删掉最前面的数字
            if (record.size() == k + 1){
                record.erase(nums[i - k]);
            }
        }
        return false;
    }
};