Class MyHashMap
-
- All Implemented Interfaces:
public final class MyHashMap
706 - Design HashMap\.
Easy
Design a HashMap without using any built-in hash table libraries.
Implement the
MyHashMap
class:MyHashMap()
initializes the object with an empty map.void put(int key, int value)
inserts a(key, value)
pair into the HashMap. If thekey
already exists in the map, update the correspondingvalue
.int get(int key)
returns thevalue
to which the specifiedkey
is mapped, or-1
if this map contains no mapping for thekey
.void remove(key)
removes thekey
and its correspondingvalue
if the map contains the mapping for thekey
.
Example 1:
Input
"MyHashMap", "put", "put", "get", "get", "put", "get", "remove", "get"
[ [], 1, 1, 2, 2, 1, 3, 2, 1, 2, 2, 2]
Output: null, null, null, 1, -1, null, 1, null, -1
Explanation:
MyHashMap myHashMap = new MyHashMap(); myHashMap.put(1, 1); // The map is now [[1,1]] myHashMap.put(2, 2); // The map is now [[1,1], [2,2]] myHashMap.get(1); // return 1, The map is now [[1,1], [2,2]] myHashMap.get(3); // return -1 (i.e., not found), The map is now [[1,1], [2,2]] myHashMap.put(2, 1); // The map is now [[1,1], [2,1]] (i.e., update the existing value) myHashMap.get(2); // return 1, The map is now [[1,1], [2,1]] myHashMap.remove(2); // remove the mapping for 2, The map is now [[1,1]] myHashMap.get(2); // return -1 (i.e., not found), The map is now [[1,1]]
Constraints:
<code>0 <= key, value <= 10<sup>6</sup></code>
At most <code>10<sup>4</sup></code> calls will be made to
put
,get
, andremove
.
-
-
Constructor Summary
Constructors Constructor Description MyHashMap()
-