2018年4月26日
PAT-甲级-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 @ 2018-04-26 10:27 leezheng 阅读(157) 评论(0) 推荐(0) 编辑