leetcode705+使用数组来模拟hashset

最新推荐文章于 2022-07-27 00:32:01 发布

小堃哥

最新推荐文章于 2022-07-27 00:32:01 发布

阅读量151

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/u013554860/article/details/83378878

版权

Leetcode 专栏收录该内容

450 篇文章 0 订阅

订阅专栏

https://leetcode.com/problems/design-hashset/description/

class MyHashSet {
public:
    int Set[1000010] = {0};
    /** Initialize your data structure here. */
    MyHashSet() {
        
    }
    
    void add(int key) {
        if(Set[key]==0) Set[key]+=1;
    }
    
    void remove(int key) {
        if(Set[key]>0) Set[key] = 0;
    }
    
    /** Returns true if this set contains the specified element */
    bool contains(int key) {
        if(Set[key]>0) return true;
        else return false;
    }
};

/**
 * Your MyHashSet object will be instantiated and called as such:
 * MyHashSet obj = new MyHashSet();
 * obj.add(key);
 * obj.remove(key);
 * bool param_3 = obj.contains(key);
 */