PTA_7-1 Pop Sequence（25 分）_给指定的序列压栈,能够随时出栈,问你出栈顺序是否正确

7-1 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 pos

>>阅读原文<<