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
| class MyHashSet {
public:
/** Initialize your data structure here. */
MyHashSet() :
N(0), M(10000)
{
keys = new int [10000]();
for(int i = 0; i < 10000; ++i)
keys[i] = -1;
}
void add(int key) {
int i = (key & 0x7fffffff) % M;
for( ; keys[i] != -1; i = (i + 1) % M) {
if(keys[i] == key)
return ;
}
keys[i] = key;
N++;
}
void remove(int key) {
if(!contains(key))
return ;
int i = (key & 0x7fffffff) % M;
for( ; keys[i] != -1; i = (i + 1) % M) {
if(keys[i] == key)
break;
}
int k2;
keys[i] = -1;
i = (i + 1) % M;
while(keys[i] != -1){
k2 = keys[i];
keys[i] = -1;
--N;
add(k2);
i = (i + 1) % M;
}
--N;
}
/** Returns true if this set contains the specified element */
bool contains(int key) {
int i = (key & 0x7fffffff) % M;
for( ; keys[i] != -1; i = (i + 1) % M) {
if(keys[i] == key)
return true;
}
return false;
}
private:
int *keys;
int N;
int M;
};
|
