class MyHashSet {
public:
/** Initialize your data structure here. */
MyHashSet() {
}
void add(int key) {
if (v[key] == 0)
++v[key];
}
void remove(int key) {
if (v[key] > 0)
--v[key];
}
/** Returns true if this set did not already contain the specified element */
bool contains(int key) {
if (v[key] > 0)
return true;
return false;
}
private:
vector<int> v;
};
/**
* 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);
*/
2 回答
泛舟湖上清波郎朗
TA贡献1818条经验 获得超3个赞
没明白楼主的描述？ /** * Your MyHashSet object will be instantiated and called as such: * MyHashSet obj = new MyHashSet(); * obj.add(key); //你这里的key的定义呢？/////////////////// * obj.remove(key); * bool param_3 = obj.contains(key); */
- 2 回答
- 0 关注
- 1886 浏览
添加回答
举报
0/150
提交
取消