[第二轮] 3/4-3/10 CareerCup 3.3

Imagine a (literal) stack of plates. If the stack gets too high, it might topple. Therefore, in real life, we would likely start a new stack when the previous stack exceeds some threshold. Implement a data structure SetOfStacks that mimics this. SetOfStacks should be composed of several stacks and should create a new stack once the previous one exceeds capacity.SetOfStacks.push() and SetOfStacks.pop() should behave identically to a single stack (that is, pop() should return the same values as it would if there were just a single stack).
FOLLOW UP
Implement a function popAt(int index) which performs a pop operation on a specific sub-stack.


发帖规范:
http://www.1point3acres.com/bbs/thread-48094-1-1.html
http://www.1point3acres.com/bbs/thread-32423-1-1.html

SetOfStacks could be made of two dynamic arrays. if the current stack exceeds the capacity;  push all values to the enough hold stack; enlarge the current stack; push the value in the hold stack to the current stack back.  And SetOfStacks.push() is the current stack.push(); SetOfStacks.pop() is the current stack.pop(). Function popAt(int index) is an easy one, just move.

Using a resized array to store the pointers by which linked lists are pointed.
https://github.com/moophis/careercup/blob/master/3.3.cpp

Java, use ArrayList<MyStack>();

push()
1. push elements into stack
1. Once a stack is full, put the stack into ArrayList().
2. create a new stack.  GOTO 1.

int pop() & int popAt()
1. Pop stack with function pop() in MyStack
2. Once stack is empty, use the stack in ArrayList()

https://gist.github.com/lazyGoose/5095641

https://gist.github.com/ThunderXu/5122917
use a vector<stack> to realize

https://github.com/quantumrose/C ... .3.SetOfStacks.java

Use an ArrayList of stacks

https://gist.github.com/flatlight/5126804
Stack: array stack
SetOfStacks: linked stack of stacks

https://github.com/1094401996/Ca ... ot3/SetOfStack.java
followup还没写。。。。发现自己理解和答案有出入。。。。想不明白这么好的一本书为什么不完善一下答案。。。

https://gist.github.com/chrislukkk/5158494

pop和push很简单 加个checkpoint验证threshold就可以了
popAt就直接pop，如果一个stack pop以后为空则删除该stack。
我觉得书上那个rolling over的方法不太好。。还要追踪stack的bottom。。那还是stack嘛。。