pat 甲级 stack A1051 Pop Sequence (25分) 判断出栈顺序是否正确
1051 Pop Sequence (25分)
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. For example, if M is
原创
2020-07-21 13:17:42 ·
96 阅读 ·
0 评论