Chapter 3 | Stacks and Queues
3.1 Describe how you could use a single array to implement three stacks.
分段呗- -
一倍冗余数据,分段可以减少冗余数据
直接malloc个新的 何难。。需要考虑边界条件,中间子栈是空的。
http://blog.csdn.net/kkkkkxiaofei/article/details/8333644
3.5 Implement a MyQueue class which implements a queue using two stacks.
如原解,似乎效率很低
额外结构排序。插入排序