add design-2

implement_hashmap.py

@@ -0,0 +1,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]

queue_using_stack.py

@@ -0,0 +1,22 @@
+class MyQueue:
+    def __init__(self):
+        self.inSt = []
+        self.outSt = []
+
+    def push(self, x: int) -> None:
+        self.inSt.append(x)
+
+    def pop(self) -> int:
+        if self.empty():
+            return -1
+        self.peek()
+        return self.outSt.pop()
+
+    def peek(self) -> int:
+        if not self.outSt:
+            while self.inSt:
+                self.outSt.append(self.inSt.pop())
+        return self.outSt[-1]
+
+    def empty(self) -> bool:
+        return not self.inSt and not self.outSt