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 | 1101 Views, 15988 Search Bots | 137 Words
| Browse | Archive
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 1101 Views, 15988 Search Bots | 137 Words
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
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 | 1101 Views, 15988 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
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Related Articles
- How to Play WAV music under DOS?
- Spreadsheet Columns
- Algorithm Interview: Subarray With Target Sum
- Daily Interview Question: Find Cycles in a Graph
- Daily Interview Problem: Circle of Chained Words
- Kaprekar
- Daily Interview Problem: Min Range Needed to Sort
- Detect Linked List Cycle
- Daily Interview Problem: Running Median
- Linode Support Ticket 10029540 - Other - Important Notice Regarding Ubuntu 17.10 Image
©2006~2024 SteakOverCooked - 0.01071 Seconds(s) - 5053.05 KB/s - 43 Online
Memory: 518.7 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" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !