leetcode/java/706_Design_HashMap.java at master · tonardo2015/leetcode · 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
classMyHashMap {
finalListNode[] nodes = newListNode[10000];
// https://leetcode.com/problems/design-hashmap/discuss/152746/Java-Solution
publicvoidput(intkey, intvalue) {
inti = idx(key);
if (nodes[i] == null)
nodes[i] = newListNode(-1, -1);
ListNodeprev = find(nodes[i], key);
if (prev.next == null)
prev.next = newListNode(key, value);
elseprev.next.val = value;
 }

publicintget(intkey) {
inti = idx(key);
if (nodes[i] == null)
return -1;
ListNodenode = find(nodes[i], key);
returnnode.next == null ? -1 : node.next.val;
 }

publicvoidremove(intkey) {
inti = idx(key);
if (nodes[i] == null) return;
ListNodeprev = find(nodes[i], key);
if (prev.next == null) return;
prev.next = prev.next.next;
 }

intidx(intkey) { returnInteger.hashCode(key) % nodes.length;}

ListNodefind(ListNodebucket, intkey) {
ListNodenode = bucket, prev = null;
while (node != null && node.key != key) {
prev = node;
node = node.next;
 }
returnprev;
 }

classListNode {
intkey, val;
ListNodenext;

ListNode(intkey, intval) {
this.key = key;
this.val = val;
 }
 }
}