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,为什么执行出错呢?
- 写回答
- 好问题 0 提建议
- 关注问题
- 邀请回答
-
2条回答 默认 最新
- threenewbee 2018-10-29 12:15关注
#include <iostream> #include <vector> using namespace std; class MyHashSet { private: vector<int> v; //这个放在前面,否则找不到定义 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; } }; int main() { }
本回答被题主选为最佳回答 , 对您是否有帮助呢?解决 无用评论 打赏 举报