1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33
| class MyHashSet { private: vector<list<int>> data; static const int base = 769; static int hash(int key) { return key % base; } public: MyHashSet(): data(base) { } void add(int key) { int h = hash(key); for (auto it = data[h].begin(); it != data[h].end(); ++it) if ((*it) == key) return; data[h].push_back(key); } void remove(int key) { int h = hash(key); for (auto it = data[h].begin(); it != data[h].end(); ++it) if ((*it) == key) { data[h].erase(it); return; } } bool contains(int key) { int h = hash(key); for (auto it = data[h].begin(); it != data[h].end(); ++it) if ((*it) == key) return true; return false; } };
|