2017年11月4日
1051. 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 @ 2017-11-04 14:46 gaoren 阅读(134) 评论(0) 推荐(0) 编辑