Design-2/implement_hashmap.py at d8676abb4dbc16caf1a070547ce24b5f09f9509e · super30admin/Design-2 · GitHub

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
class MyHashMap:

    def __init__(self):
        self.primaryBuckets = 1000
        self.secondaryBuckets = 1000
        self.storage = [None] * self.primaryBuckets

    def getPrimaryHash(self, key):
        return key % self.primaryBuckets

    def getSecondaryHash(self, key):
        return key // self.secondaryBuckets

    def put(self, key, value):
        primaryIndex = self.getPrimaryHash(key)
        if self.storage[primaryIndex] == None:
            if primaryIndex == 0:
                self.storage[primaryIndex] = [-1] * (self.secondaryBuckets + 1)
            else:
                self.storage[primaryIndex] = [-1] * self.secondaryBuckets
        secondaryIndex = self.getSecondaryHash(key)
        self.storage[primaryIndex][secondaryIndex] = value

    def remove(self, key):
        primaryIndex = self.getPrimaryHash(key)
        if self.storage[primaryIndex] == None:
            return
        secondaryIndex = self.getSecondaryHash(key)
        self.storage[primaryIndex][secondaryIndex] = -1

    def get(self, key):
        primaryIndex = self.getPrimaryHash(key)
        if self.storage[primaryIndex] == None:
            return -1
        secondaryIndex = self.getSecondaryHash(key)
        return self.storage[primaryIndex][secondaryIndex]