PAT 1051 Pop Sequence (25分) 模拟入栈
PAT 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.