PAT 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 i
原创
2020-06-09 17:33:41 ·
178 阅读 ·
0 评论