2019年10月13日
7-3 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 s 阅读全文
posted @ 2019-10-13 15:39 熊猫blue 阅读(391) 评论(0) 推荐(0) 编辑