219.存在重复元素 II

😝实现

set的大小用来记录距离值K。

class Solution {
public:
    bool containsNearbyDuplicate(vector<int>& nums, int k) {
        set<int> st;
        for(int i = 0; i < nums.size(); ++i) 
        {
            if(st.count(nums[i]) == 1) 
                return true;
            st.insert(nums[i]);
            if(st.size() > k) {
                st.erase(nums[i - k]);
            } 
        }
        return false;
    }
};

Accepted

23/23 cases passed (48 ms)

Your runtime beats 41.06 % of cpp submissions

Your memory usage beats 6.78 % of cpp submissions (15.6 MB)