-
Notifications
You must be signed in to change notification settings - Fork 0
/
706-DesignHashMap.java
79 lines (63 loc) · 2.13 KB
/
706-DesignHashMap.java
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
706. Design HashMap
class MyHashMap {
ListNode[] bucket;
/** Initialize your data structure here. */
public MyHashMap() {
bucket = new ListNode[10000];
}
/** value will always be non-negative. */
public void put(int key, int value) {
int index = getIndex(key);
ListNode prev = findLastElement(index, key);
if (prev.next == null) {
prev.next = new ListNode(key, value);
} else {
prev.next.value = value;
}
}
// which bucket should the Node go into
public int getIndex(int key) {
int hashCode = Integer.hashCode(key);
return hashCode % bucket.length;
}
public ListNode findLastElement(int index, int key) {
if (bucket[index] == null) {
return bucket[index] = new ListNode(-1, -1);
}
ListNode prev = bucket[index];
while (prev.next != null && prev.next.key != key) {
prev = prev.next;
}
return prev;
}
/** Returns the value to which the specified key is mapped, or -1 if this map contains no mapping for the key */
public int get(int key) {
int index = getIndex(key);
ListNode prev = findLastElement(index, key);
return prev.next == null ? -1 : prev.next.value;
}
/** Removes the mapping of the specified value key if this map contains a mapping for the key */
public void remove(int key) {
int index = getIndex(key);
ListNode prev = findLastElement(index, key);
if (prev.next != null) {
prev.next = prev.next.next;
}
}
public static class ListNode {
int key;
int value;
ListNode next;
public ListNode(int key, int value) {
this.key = key;
this.value = value;
}
}
}
/**
* Your MyHashMap object will be instantiated and called as such:
* MyHashMap obj = new MyHashMap();
* obj.put(key,value);
* int param_2 = obj.get(key);
* obj.remove(key);
*/