-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdesign-hashset.cpp
More file actions
42 lines (36 loc) · 789 Bytes
/
design-hashset.cpp
File metadata and controls
42 lines (36 loc) · 789 Bytes
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
/* Problem url: https://leetcode.com/problems/design-hashset/
* Code by: ldcduc
* */
class MyHashSet {
public:
/** Initialize your data structure here. */
int *data;
MyHashSet() {
data = (int *)calloc(1000001, sizeof(int));
}
void add(int key) {
data[key] = 1;
}
void remove(int key) {
data[key]--;
}
/** Returns true if this set contains the specified element */
bool contains(int key) {
return (data[key] > 0);
}
~MyHashSet() {
free(data);
}
};
/**
* 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);
*/
/*
* Comment by ldcduc
* Suggested tags:
*
* */