forked from varunu28/LeetCode-Java-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDesign HashMap.java
More file actions
48 lines (41 loc) · 1.28 KB
/
Design HashMap.java
File metadata and controls
48 lines (41 loc) · 1.28 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
class MyHashMap {
/** Initialize your data structure here. */
Integer[][] map;
int NUM_OF_BUCKETS = 1000;
int BUCKET_SIZE = 1000;
public MyHashMap() {
map = new Integer[NUM_OF_BUCKETS][BUCKET_SIZE];
}
/** value will always be non-negative. */
public void put(int key, int value) {
Integer[] bucket = getBucket(key);
int keyHash = getKeyHash(key);
bucket[keyHash] = value;
}
/** 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) {
Integer[] bucket = getBucket(key);
int keyHash = getKeyHash(key);
return bucket[keyHash] == null ? -1 : bucket[keyHash];
}
/** Removes the mapping of the specified value key if this map contains a mapping for the key */
public void remove(int key) {
Integer[] bucket = getBucket(key);
int keyHash = getKeyHash(key);
bucket[keyHash] = null;
}
private Integer[] getBucket(int key) {
int bucketIdx = key / BUCKET_SIZE;
return map[bucketIdx];
}
private Integer getKeyHash(int key) {
return key % BUCKET_SIZE;
}
}
/**
* 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);
*/