Repository navigation
Expand file tree
/
Copy pathDesignHashMap.java
More file actions
58 lines (45 loc) · 1.79 KB
/
Copy pathDesignHashMap.java
File metadata and controls
58 lines (45 loc) · 1.79 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
50
51
52
53
54
55
56
57
58
// 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 the key already exists in the map, update the corresponding value.
// int get(int key) returns the value to which the specified key is mapped, or -1 if this map contains no mapping for the key.
// void remove(key) removes the key and its corresponding value if the map contains the mapping for the key.
class MyHashMap {
List<Integer> values;
List<Integer> keys;
/** Initialize your data structure here. */
public MyHashMap() {
values = new ArrayList<>();
keys = new ArrayList<>();
}
/** value will always be non-negative. */
public void put(int key, int value) {
for(int i = 0; i < keys.size(); i++){
if(keys.get(i) == key){
keys.remove(i);
values.remove(i);
}
}
keys.add(key);
values.add(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) {
for(int i = 0; i < keys.size(); i++){
if(keys.get(i) == key){
return values.get(i);
}
}
return -1;
}
/** Removes the mapping of the specified value key if this map contains a mapping for the key */
public void remove(int key) {
for(int i = 0; i < keys.size(); i++){
if(keys.get(i) == key){
values.remove(i);
keys.remove(i);
break;
}
}
}
}