快乐学习
首页
归档
友链
推荐
springboot
Linux
Stack
文章
75
标签
39
评论
24
首页
归档
友链
推荐
springboot
Linux
PAT 1051 Pop Sequence (25分) 模拟入栈
发布于 2020-07-03
|
更新于 3 年前
C/C++
PAT
数据结构与算法
|
Algorithm
PAT
C++
Stack
0
评论
Given a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, ..., N and pop randomly. You are supposed to tell if a given sequence of numbers is a possible pop sequence of the stack.
1