MOOC数据结构PTA-02-线性结构4 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 gi 阅读全文
posted @ 2021-07-18 15:14 VigilYang 阅读(85) 评论(0) 推荐(0)
浙公网安备 33010602011771号