blob: b56a01a6aae1ba49aaabdf46f5c3bf8f3a4a1f55 (
plain)
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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
|
#include <vector>
#include <memory>
class MyHashSet
{
static const int max = 100;
private:
std::unique_ptr<std::vector<int>> data_[max];
public:
/** Initialize your data structure here. */
MyHashSet()
{
}
void add(int key)
{
const auto index = key % max;
auto &ptr = data_[index];
if (ptr == nullptr)
{
ptr.reset(new std::vector<int>());
}
auto &v = *ptr;
for (auto d : v)
{
if (d == key)
return;
}
v.push_back(key);
}
void remove(int key)
{
const auto index = key % max;
auto &ptr = data_[index];
if (ptr == nullptr)
return;
auto &v = *ptr;
const auto end = v.cend();
for (auto iter = v.cbegin(); iter != end; ++iter)
{
if (*iter == key)
{
v.erase(iter);
return;
}
}
}
/** Returns true if this set contains the specified element */
bool contains(int key)
{
const auto index = key % max;
auto &ptr = data_[index];
if (ptr == nullptr)
return false;
const auto &v = *ptr;
for (auto d : v)
{
if (d == key)
return true;
}
return false;
}
};
/**
* 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);
*/
|
