0
点赞
收藏
分享

微信扫一扫

【Leetcode_easy】705. Design HashSet

攻城狮Chova 2022-07-12 阅读 67
编程语言

problem

​​705. Design HashSet​​

题意:

solution1:

class MyHashSet {
public:
/** Initialize your data structure here. */
MyHashSet() {
data.resize(1000000, 0);
}

void add(int key) {
data[key] = 1;
}

void remove(int key) {
data[key] = 0;
}

/** Returns true if this set contains the specified element */
bool contains(int key) {
//if(data[key]==1) return true;
//else return false;
return data[key]==1;
}
vector<int> data;
};

/**
* 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);
*/

solution2:

 

参考

1. ​​Leetcode_easy_705. Design HashSet​​;

2. ​​Grandyang​​;

举报

相关推荐

0 条评论