Design1

DesignHashSet.py

@@ -0,0 +1,58 @@
+class MyHashSet:
+
+    def __init__(self):
+        self.buckets = 1000
+        self.bucketItem = 1000
+        self.storage = [None] * self.buckets
+
+    def hash1(self, key: int) -> int:
+        return key % self.buckets
+
+    def hash2(self, key : int) ->int:
+        return key // self.buckets
+
+    def add(self, key: int) -> None:
+
+        buckets = self.hash1(key)
+        bucketItem = self.hash2(key)
+
+        if(self.storage[buckets] == None):
+            if buckets == 0:
+                self.storage[buckets] = [False] * (self.bucketItem + 1)
+            else:
+                self.storage[buckets] = [False] * self.bucketItem
+
+
+        self.storage[buckets][bucketItem] = True
+
+
+    def remove(self, key: int) -> None:
+        buckets = self.hash1(key)
+        bucketItem = self.hash2(key)
+
+        if self.storage[buckets] == None:
+            return False
+
+        self.storage[buckets][bucketItem] = False
+
+
+
+
+
+    def contains(self, key: int) -> bool:
+        buckets = self.hash1(key)
+        bucketItem = self.hash2(key)
+
+        if self.storage[buckets] == None :
+            return False
+        return self.storage[buckets][bucketItem]
+
+        #self.storage[bucket][bucketItems] = False
+
+
+
+# Your MyHashSet object will be instantiated and called as such:
+# obj = MyHashSet()
+# obj.add(key)
+# obj.remove(key)
+# param_3 = obj.contains(key)

MinStack.py

@@ -0,0 +1,51 @@
+class MinStack:
+
+    def __init__(self):
+        # self.minElement = 2147483647
+        # self.stack = []
+        # self.minstack = []
+        # self.minstack.append(self.minElement)
+        self.min = int(sys.maxsize)
+        self.st = []
+
+
+
+    def push(self, val: int) -> None:
+        # if val < self.minElement:
+        #     self.minElement = val
+        # self.stack.append(val)
+        # self.minstack.append(self.minElement)
+        if val<= self.min:
+            self.st.append(self.min)
+            self.min = val
+        self.st.append(val)
+
+
+
+
+    def pop(self) -> None:
+        # self.stack.pop()
+        # self.minstack.pop()
+        # self.minElement = self.minstack[-1]
+        popped = self.st.pop()
+        if popped == self.min:
+            self.min = self.st.pop()
+
+
+    def top(self) -> int:
+        #return self.stack[-1]
+        return self.st[-1]
+
+    def getMin(self) -> int:
+        #return self.minElement
+        return self.min
+
+
+
+
+# Your MinStack object will be instantiated and called as such:
+# obj = MinStack()
+# obj.push(val)
+# obj.pop()
+# param_3 = obj.top()
+# param_4 = obj.getMin()