def push(self, item): if self.top: min_so_far = self.mins[-1] if min_so_far > item: self.mins.append(item) else: self.mins.append(min_so_far) else: self.mins.append(item) node = Node(item) node.next = self.top self.top = node
def push(self, item): if not self.stack_now: self._addStack() node = Node(item) node.next = self.stack_now.top self.stack_now.top = node self.stack_now_size += 1 if self._checkIfFull(): self._archiveStack()
def push(self, val): new = Node(val) new.next = self.top self.top.prev = new self.top = new