Pop Sequence栈的顺序实现

问题描述：html 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 seq

>>阅读原文<<