leetcode-java/src/DesignHashSet705.java at master · fluency03/leetcode-java · GitHub

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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
/**
 * 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:
 * All values will be in the range of [0, 1000000].
 * The number of operations will be in the range of [1, 10000].
 * Please do not use the built-in HashSet library.
 */

publicclassDesignHashSet705 {

classMyHashSet {
privatestaticfinalintK = 10000;
privateList<Integer>[] cache = newList[K];

/** Initialize your data structure here. */
publicMyHashSet() {

 }

publicvoidadd(intkey) {
intk = key % K;
if (cache[k] == null) {
cache[k] = newArrayList<>();
 }
List<Integer> list = cache[k];
for (intel: list) {
if (el == key) return;
 }
list.add(key);
 }

publicvoidremove(intkey) {
intk = key % K;
if (cache[k] == null) return;
List<Integer> list = cache[k];

for (inti=0; i<list.size(); i++) {
if (list.get(i) == key) {
list.remove(i);
return;
 }
 }
 }

/** Returns true if this set contains the specified element */
publicbooleancontains(intkey) {
intk = key % K;
if (cache[k] == null) returnfalse;
List<Integer> list = cache[k];
for (intel: list) {
if (el == key) returntrue;
 }
returnfalse;
 }
 }


classMyHashSet2 {
privatestaticfinalintK = 10000;
privateTreeNode[] cache = newTreeNode[K];

/** Initialize your data structure here. */
publicMyHashSet2() {

 }

publicvoidadd(intkey) {
intk = key % K;
cache[k] = addNode(cache[k], key);
 }

TreeNodeaddNode(TreeNoderoot, intkey) {
if (root == null) returnnewTreeNode(key);
if (root.key > key) {
root.left = addNode(root.left, key);
 } elseif (root.key < key) {
root.right = addNode(root.right, key);
 }
returnroot;
 }

publicvoidremove(intkey) {
intk = key % K;
cache[k] = removeNode(cache[k], key);
 }

TreeNoderemoveNode(TreeNoderoot, intkey) {
if (root == null) returnnull;
if (root.key > key) {
root.left = removeNode(root.left, key);
 } elseif (root.key < key) {
root.right = removeNode(root.right, key);
 } else {
if (root.left == null) {
returnroot.right;
 } elseif (root.right == null) {
returnroot.left;
 } else {
root.key = findMin(root.right);
root.right = removeNode(root.right, root.key);
 }
 }
returnroot;
 }

intfindMin(TreeNoderoot) {
while (root.left != null) {
root = root.left;
 }
returnroot.key;
 }

/** Returns true if this set contains the specified element */
publicbooleancontains(intkey) {
returncontainNode(cache[key % K], key);
 }

booleancontainNode(TreeNoderoot, intkey) {
if (root == null) returnfalse;
if (root.key == key) returntrue;
returncontainNode(root.left, key) || containNode(root.right, key);
 }

classTreeNode {
TreeNodeleft;
TreeNoderight;
intkey;
TreeNode(intkey) {
this.key = key;
 }
 }

 }


/**
 * Your MyHashSet object will be instantiated and called as such:
 * MyHashSet obj = new MyHashSet();
 * obj.add(key);
 * obj.remove(key);
 * boolean param_3 = obj.contains(key);
 */

}