2015年5月29日
数据结构练习 02-线性结构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 @ 2015-05-29 12:12 Cizel丶攻城狮 阅读(401) 评论(0) 推荐(0)