-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDay2. Design_HashSet.cpp
85 lines (67 loc) · 2.01 KB
/
Day2. Design_HashSet.cpp
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
80
81
82
83
84
85
/*
Design HashSet
Design a HashSet without using any built-in hash table libraries.
To be specific, your design should include these functions:
add(value): Insert a value into the HashSet.
contains(value) : Return whether the value exists in the HashSet or not.
remove(value): Remove a value in the HashSet. If the value does not exist in the HashSet, do nothing.
Example:
MyHashSet hashSet = new MyHashSet();
hashSet.add(1);
hashSet.add(2);
hashSet.contains(1); // returns true
hashSet.contains(3); // returns false (not found)
hashSet.add(2);
hashSet.contains(2); // returns true
hashSet.remove(2);
hashSet.contains(2); // returns false (already removed)
Note:
1. All values will be in the range of [0, 1000000].
2. The number of operations will be in the range of [1, 10000].
3. Please do not use the built-in HashSet library.
*/
#define hash_key 500009
class MyHashSet {
public:
/** Initialize your data structure here. */
vector<int> hash[hash_key];
MyHashSet() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
}
void add(int key)
{
int x= key % hash_key;
if(find_pos(key)==hash[x].end())
hash[x].push_back(key);
}
void remove(int key)
{
int x= key % hash_key;
auto it = find_pos(key);
if(it!=hash[x].end())
hash[x].erase(it);
}
/** Returns true if this set contains the specified element */
bool contains(int key)
{
int x= key % hash_key;
return find_pos(key)!=hash[x].end();
}
vector<int> :: iterator find_pos(int key)
{
int x= key % hash_key;
auto it =hash[x].begin();
for(it;it!=hash[x].end();it++)
{
if(*it==key) break;
}
return it;
}
};
/**
* 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);
*/