1051 Pop Sequence (25 分)
1051Pop Sequence(25分)
Given a stack which can keepMnumbers at most. PushNnumbers in the order of 1, 2, 3, ...,Nand pop randomly. You are supposed to tell if a given sequence of numbers is a ...
原创
2019-04-01 22:18:23 ·
339 阅读 ·
0 评论