文件: root - text - article - 2019 - 10 - maximum-in-a-stack.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 主页 | 类别: 计算机科学 | 427 次阅读, 16985 次搜索 | 105 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 主页 | 类别: 计算机科学 | 427 次阅读, 16985 次搜索 | 105 个单词
| 浏览 | 博客存档
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.
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 主页 | 类别: 计算机科学 | 427 次阅读, 16985 次搜索 | 105 个单词 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
猜您喜欢...
- Daily Interview Problem: Reverse Integer
- Daily Interview Problem: Merge List Of Number Into Ranges
- Algorithm Interview: Longest Consecutive Sequence
- Print a tree level-by-level, with line-breaks
- [Daily Problem] Angles of a Clock
- Daily Interview Problem: Full Binary Tree
- 56 Bytes
- [Daily Problem] Longest Palindromic Substring
- Staying on a Chess Board
- A trick for getting good at coding interviews FASTER
©2006~2024 牛排过熟 - 0.01288 秒 - 1398.741 KB/s - 45 在线 内存: 492.97 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
评论 (0)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。