-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDesign HashMap.cs
More file actions
48 lines (42 loc) · 1.3 KB
/
Design HashMap.cs
File metadata and controls
48 lines (42 loc) · 1.3 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
public class MyHashMap {
private int[][] buckets;
private int k;
private int Hash(int key) {
return key % k;
}
/** Initialize your data structure here. */
public MyHashMap() {
buckets = new int[1000][];
k = 1000;
}
/** value will always be non-negative. */
public void Put(int key, int value) {
var hashKey = Hash(key);
if (buckets[hashKey] == null) {
buckets[hashKey] = Enumerable.Repeat(-1, 1001).ToArray();
}
buckets[hashKey][key / k] = 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) {
var hashKey = Hash(key);
if (buckets[hashKey] != null) {
return buckets[hashKey][key / k];
}
return -1;
}
/** Removes the mapping of the specified value key if this map contains a mapping for the key */
public void Remove(int key) {
var hashKey = Hash(key);
if (buckets[hashKey] != null) {
buckets[hashKey][key / k] = -1;
}
}
}
/**
* 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);
*/