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
| class MyHashSet {
private static class Node {
private final int key;
private Node next;
public Node(int key) {
this.key = key;
}
}
private final Node[] table;
public MyHashSet() {
this.table = new Node[10000];
}
public void add(int key) {
int tabIndex = hash(key);
if (table[tabIndex] == null) {
table[tabIndex] = new Node(key);
} else {
Node prev = null;
Node curr = table[tabIndex];
while (curr != null && curr.key != key) {
prev = curr;
curr = curr.next;
}
if (curr == null) {
prev.next = new Node(key);
}
}
}
private int hash(int key) {
return key % table.length;
}
public void remove(int key) {
int tabIndex = hash(key);
Node prev = null;
Node curr = table[tabIndex];
while (curr != null && curr.key != key) {
prev = curr;
curr = curr.next;
}
if (curr != null) {
if (prev == null) {
table[tabIndex] = curr.next;
} else {
prev.next = curr.next;
}
}
}
public boolean contains(int key) {
int tabIndex = hash(key);
Node curr = table[tabIndex];
while (curr != null && curr.key != key) {
curr = curr.next;
}
return curr != null;
}
}
|