面试题 03.01. 三合一

三合一。描述如何只用一个数组来实现三个栈。

你应该实现push(stackNum, value)、pop(stackNum)、isEmpty(stackNum)、peek(stackNum)方法。stackNum表示栈下标，value表示压入的值。

构造函数会传入一个stackSize参数，代表每个栈的大小。

示例1:

输入：
[“TripleInOne”, “push”, “push”, “pop”, “pop”, “pop”, “isEmpty”]
[[1], [0, 1], [0, 2], [0], [0], [0], [0]]
输出：
[null, null, null, 1, -1, -1, true]
说明：当栈为空时pop, peek返回-1，当栈满时push不压入元素。

示例2:

输入：
[“TripleInOne”, “push”, “push”, “push”, “pop”, “pop”, “pop”, “peek”]
[[2], [0, 1], [0, 2], [0, 3], [0], [0], [0], [0]]
输出：
[null, null, null, null, 2, 1, -1, -1]

class TripleInOne {
    int[] index;
    int[][] stack;
    int size;

    public TripleInOne(int stackSize) {
        size = stackSize;
        stack = new int[3][stackSize];
        index = new int[3];
    }
    
    public void push(int stackNum, int value) {
        int point = index[stackNum];
        if(point<size){
            stack[stackNum][point] = value;
            index[stackNum]++;
        }
        

    }
    
    public int pop(int stackNum) {
        if(isEmpty(stackNum)){
            return -1;
        }
        int point = index[stackNum];
        int ret = stack[stackNum][point-1];
        index[stackNum]--;
        return ret;

    }
    
    public int peek(int stackNum) {
        if(isEmpty(stackNum)){
            return -1;
        }
        int point = index[stackNum];
        return stack[stackNum][point-1];

    }
    
    public boolean isEmpty(int stackNum) {
        return index[stackNum]==0;
    }
}

/**
 * Your TripleInOne object will be instantiated and called as such:
 * TripleInOne obj = new TripleInOne(stackSize);
 * obj.push(stackNum,value);
 * int param_2 = obj.pop(stackNum);
 * int param_3 = obj.peek(stackNum);
 * boolean param_4 = obj.isEmpty(stackNum);
 */