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);
*/
leetcode 705,為什么執(zhí)行出錯(cuò)呢？
慕田峪7331174
2018-10-30 13:13:22
