2018_2_7_Stack By Stack _记忆递归升级_哈希
注意long long
There are n stacks, named in order S[1], S[2], S[3], ... ,S[n]. Initially, all of them are empty. The following process ends when S[n] is full.
If non of the stacks is full, S[1] is
原创
2018-02-07 12:26:34 ·
207 阅读 ·
0 评论