File: root - text - article - 2019 - 12 - min-stack.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 1328 Views, 19290 Search Bots | 137 Words
| Browse | Archive
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 1328 Views, 19290 Search Bots | 137 Words
| Browse | Archive
Hi, here's your problem today. This problem was recently asked by Uber:
Design a simple stack that supports push, pop, top, and retrieving the minimum element in constant time.
push(x) -- Push element x onto stack.
pop() -- Removes the element on top of the stack.
top() -- Get the top element.
getMin() -- Retrieve the minimum element in the stack.
Note: be sure that pop() and top() handle being called on an empty stack.
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 1328 Views, 19290 Search Bots | 137 Words Design a simple stack that supports push, pop, top, and retrieving the minimum element in constant time.
push(x) -- Push element x onto stack.
pop() -- Removes the element on top of the stack.
top() -- Get the top element.
getMin() -- Retrieve the minimum element in the stack.
Note: be sure that pop() and top() handle being called on an empty stack.
class minStack(object):
def __init__(self):
# Fill this in.
def push(self, x):
# Fill this in.
def pop(self):
# Fill this in.
def top(self):
# Fill this in.
def getMin(self):
# Fill this in.
x = minStack()
x.push(-2)
x.push(0)
x.push(-3)
print(x.getMin())
# -3
x.pop()
print(x.top())
# 0
print(x.getMin())
# -2
Related Articles
- Floor and Ceiling of a Binary Search Tree
- Daily Interview Problem: Deepest Node in a Binary Tree
- Sort a Partially Sorted List
- Spreadsheet Column Title
- Algorithm Interview Question: Max and Min with Limited Comparisons
- Daily Interview Problem: Maximum Profit From Stocks
- Design Tic-Tac-Toe
- Daily Interview Problem: 3 Sum
- [Daily Problem] Witness of The Tall People
- Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
©2006~2024 SteakOverCooked - 0.01488 Seconds(s) - 3621.485 KB/s - 24 Online Memory: 516.69 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Comments (0)
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !