文件名称：陈越、何钦铭-数据结构作业7：Pop Sequence出栈序列检验
文件大小：4KB
文件格式：CPP
更新时间：2021-04-16 15:20:09
陈越 数据结构 Pop Sequence 出栈序列检验
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 5 and N is 7, we can obtain 1, 2, 3, 4, 5, 6, 7 from the stack, but not 3, 2, 1, 7, 5, 6, 4.