File: root - text - article - 2019 - 10 - maximum-in-a-stack.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Category: Computing | 430 Views, 17538 Search Bots | 105 Words
| Browse | Archive
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Category: Computing | 430 Views, 17538 Search Bots | 105 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 Twitter:
Implement a class for a stack that supports all the regular functions (push, pop) and an additional function of max() which returns the maximum element in the stack (return None if the stack is empty). Each method should run in constant time.
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Cateogry: Computing | 430 Views, 17538 Search Bots | 105 Words Implement a class for a stack that supports all the regular functions (push, pop) and an additional function of max() which returns the maximum element in the stack (return None if the stack is empty). Each method should run in constant time.
class MaxStack:
def __init__(self):
# Fill this in.
def push(self, val):
# Fill this in.
def pop(self):
# Fill this in.
def max(self):
# Fill this in.
s = MaxStack()
s.push(1)
s.push(2)
s.push(3)
s.push(2)
print s.max()
# 3
s.pop()
s.pop()
print s.max()
# 2
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Related Articles
- Batch Programming in XP
- [Daily Problem] Validate Balanced Parentheses
- Daily Interview Puzzle: Intersection of Linked Lists
- Algorithm Interview: Smallest Number that is not a Sum of a Subset of List
- Daily Interview Question: Create a Simple Calculator
- Linode Support Ticket 10029540 - Other - Important Notice Regarding Ubuntu 17.10 Image
- YES!!
- Longest Substring Without Repeating Characters
- Invert a Binary Tree
- Most Frequent Subtree Sum
©2006~2024 SteakOverCooked - 0.01332 Seconds(s) - 4014.513 KB/s - 23 Online
Memory: 527.84 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 !