摘要: 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 @ 2018-12-04 22:34 dgi 阅读(494) 评论(0) 推荐(0) 编辑