Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Complete HashSet and MinStack design #2259

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
37 changes: 37 additions & 0 deletions MinStack.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,37 @@
# Time complexity: O(1)
# Space complexity: O(n)
import sys
class MinStack:

def __init__(self):
self.min = None
self.stack = []
self.minStack = []
self.minStack.append(sys.maxsize)

def push(self, val: int) -> None:
if self.min == None: self.min = val
elif val <= self.min:
self.minStack.append(self.min)
self.min = val
self.stack.append(val)

def pop(self) -> None:
top = self.stack.pop()
if top == self.min:
self.min = self.minStack.pop()

def top(self) -> int:
return self.stack[-1]

def getMin(self) -> int:
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()
36 changes: 36 additions & 0 deletions MyHashSet.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,36 @@
class MyHashSet:

def __init__(self):
self.bucketSize = 1000
self.bucketItemSize = 1000
self.storage = [None] * self.bucketSize

def bucket(self, key: int) -> int:
return key % self.bucketSize

def bucketItem(self, key: int) -> int:
return key // self.bucketItemSize


def add(self, key: int) -> None:
if self.storage[self.bucket(key)] == None:
self.storage[self.bucket(key)] = [False] * (self.bucketItemSize + 1)
self.storage[self.bucket(key)][self.bucketItem(key)] = True

def remove(self, key: int) -> None:
if self.storage[self.bucket(key)] != None:
self.storage[self.bucket(key)][self.bucketItem(key)] = False


def contains(self, key: int) -> bool:
if self.storage[self.bucket(key)] != None:
return self.storage[self.bucket(key)][self.bucketItem(key)]
return False



# Your MyHashSet object will be instantiated and called as such:
# obj = MyHashSet()
# obj.add(key)
# obj.remove(key)
# param_3 = obj.contains(key)