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

Describe how you could use a single array to implement three stacks.



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

分成三份，用变量维护下栈顶和栈底上下标，模拟下栈就好了？这题是考实现么还是什么？。。single array可以用Dynamic arrays搞一下么。。。？

all elements in a stack could be represented in array using two array slots:
for stack element obj
a[i] = value of obj
a[i+1] = the index of next stack element below obj in stack.
so we should reserve first 3 array slots for 3 stacks, each slot points to the array index of top element in one stack.

1. Divide An array into three parts. And define  "stackSize = 5"
2. Then, starting position of three stack is 0, stackSize, stackSize * 2

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

https://github.com/longwei/Algo/ ... rrayThreeStack.java
.  

哎，
好多题目都看不懂是什么意思。。。。。
包括这道。。。。
智商是硬伤啊

leonsu777 发表于 2013-3-5 06:42
https://github.com/longwei/Algo/ ... rrayThreeStack.java
.

可不可以讲一讲这个题目是什么意思啊

The first stack use the left-most element to be bottom and grow from left to right, the second stack use the right-most element as bottom and grow from right to left, the third stack is in the middle of array, its position will have to change if there is not enought space.

可不可以这样。
stack的0,1,2位分别是stack1，2,3的head，当有data插入stack2的时候，stack3head就向后移一位，当有data进入stack1的时候，stack2head and stack3head就向后各移一位。

https://github.com/quantumrose/C ... MultipleStacks.java

flexible division