Design HashMap LeetCode solution in Python

1
class MyHashMap:
2
    def __init__(self):
3
        self.data = [None] * 1000001
4

5
    def put(self, key: int, val: int) -> None:
6
        self.data[key] = val
7

8
    def get(self, key: int) -> int:
9
        val = self.data[key]
10
        return val if val != None else -1
11

12
    def remove(self, key: int) -> None:
13
        self.data[key] = None