Repository navigation
Expand file tree
/
Copy pathMyHashMap.java
More file actions
49 lines (42 loc) · 1.41 KB
/
Copy pathMyHashMap.java
File metadata and controls
49 lines (42 loc) · 1.41 KB
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
class MyHashMap{
final ListNode[] nodes = new ListNode[10000];
public void put(int key, int value){
int i = idx(key);
if(nodes[i] == null)
nodes[i] = new ListNode(-1, -1);
ListNode prev = find(nodes[i], key);
if(prev.next == null)
prev.next = new ListNode(key, value);
else prev.next.val = value;
}
public int get(int key){
int i = idx(key);
if(nodes[i] == null)
return -1;
ListNode node = find(nodes[i], key);
return node.next == null ? -1 : node.next.val;
}
public void remove(int key){
int i = idx(key);
if(nodes[i] != null){
ListNode prev = find(nodes[i], key);
if(prev.next != null)
prev.next = prev.next.next;
}
}
int idx(int key){return Integer.hashCode(key) % nodes.length;}
ListNode find(ListNode bucket, int key){
ListNode node = bucket, prev = null;
for(; node != null && node.key != key; node = node.next)
prev = node;
return prev;
}
class ListNode{
int key, val;
ListNode next;
ListNode(int key, int val){
this.key = key;
this.val = val;
}
}
}