[Array]Contains Duplicate II

最新推荐文章于 2020-03-01 20:16:57 发布

UFO_good

最新推荐文章于 2020-03-01 20:16:57 发布

阅读量219

点赞数

分类专栏： [leetcode]

本文链接：https://blog.csdn.net/ljlsn/article/details/51850422

版权

[leetcode] 专栏收录该内容

18 篇文章 0 订阅

订阅专栏

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 difference between i and j is at most k.

利用unordered_set速度会比set速度快很多。

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