[编程题]Stack (30)
- 热度指数：5449 时间限制：C/C++ 1秒，其他语言2秒 空间限制：C/C++ 64M，其他语言128M
- 算法知识视频讲解
Stack is one of the most fundamental data structures, which is based on
the principle of Last In First Out (LIFO). The basic operations include
Push (inserting an element onto the top position) and Pop (deleting the
top element). Now you are supposed to implement a stack with an extra
operation: PeekMedian -- return the median value of all the elements in
the stack. With N elements, the median value is defined to be the
(N/2)-th smallest element if N is even, or ((N+1)/2)-th if N is odd.
输入描述:
Each input file contains one test case. For each case, the first line contains a positive integer N (<= 105). Then N lines follow, each contains a command in one of the following 3 formats:
Push key
Pop
PeekMedian
where key is a positive integer no more than 105.
输出描述:
For each Push command, insert key into the stack and output nothing. For each Pop or PeekMedian command, print in a line the corresponding returned value. If the command is invalid, print "Invalid" instead.
示例1
输入
17 Pop PeekMedian Push 3 PeekMedian Push 2 PeekMedian Push 1 PeekMedian Pop Pop Push 5 Push 4 PeekMedian Pop Pop Pop Pop
输出
Invalid Invalid 3 2 2 1 2 4 4 5 3 Invalid
问题信息
难度：
22条回答
16收藏
15675浏览
通过挑战的用户
-
2023-03-15 18:09:22 -
2023-03-11 13:42:59
-
2023-03-04 22:08:52 -
2023-02-24 16:22:16 -
2023-02-24 14:39:23
相关试题
-
扫描二维码，关注牛客网
- 意见反馈
-
下载牛客APP，随时随地刷题
扫一扫，把题目装进口袋
- 求职之前，先上牛客
-
扫描二维码，进入QQ群
扫描二维码，关注牛客公众号
- 公司地址：北京市朝阳区北苑路北美国际商务中心K1座一层-北京牛客科技有限公司
- 联系方式：010-60728802 投诉举报电话：010-57596212（朝阳人力社保局）
- 牛客科技© All rights reserved admin@nowcoder.com
- 京ICP备14055008号-4 增值电信业务经营许可证 营业执照 人力资源服务许可证
-
京公网安备
11010502036488号
