design_hash_map.py

'''
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:

    def __init__(self):
        self.m = dict()

    def put(self, key: int, value: int) -> None:
        if key in self.m.keys():
            self.m[key] = value
        else:
            self.m[key] = value

    def get(self, key: int) -> int:
        if key in self.m.keys():
            
            return self.m[key]
        else:
            return -1
        

    def remove(self, key: int) -> None:
        if key in self.m.keys():            
            self.m.pop(key)
        
       
# Your MyHashMap object will be instantiated and called as such:
# obj = MyHashMap()
# obj.put(key,value)
# param_2 = obj.get(key)
# obj.remove(key)