数据结构习题Pop Sequence的理解----小白笔记^_^
摘要：
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 t 阅读全文
posted @ 2018-06-07 00:18 适当大 阅读(2742) 评论(0) 推荐(0) 编辑
