[LeetCode] 706. Design HashMap (Python)

• Reference
• 체이닝 방식은 이해하기 너무 힘들어서 일단 지금은 이 방식으로 풀었다,,

Solution

class MyHashMap:

    def __init__(self):
        self.map = [-1 for _ in range(1000001)]

    def put(self, key: int, value: int) -> None:
        self.map[key] = value

    def get(self, key: int) -> int:
        return self.map[key]

    def remove(self, key: int) -> None:
        self.map[key] = -1

# Your MyHashMap object will be instantiated and called as such:
# obj = MyHashMap()
# obj.put(key,value)
# param_2 = obj.get(key)
# obj.remove(key)