堆盘子。设想有一堆盘子,堆太高可能会倒下来。因此,在现实生活中,盘子堆到一定高度时,我们就会另外堆一堆盘子。请实现数据结构SetOfStacks,模拟这种行为。SetOfStacks应该由多个栈组成,并且在前一个栈填满时新建一个栈。此外,SetOfStacks.push()和SetOfStacks.pop()应该与普通栈的操作方法相同(也就是说,pop()返回的值,应该跟只有一个栈时的情况一样)。 进阶:实现一个popAt(int index)方法,根据指定的子栈,执行pop操作。
当某个栈为空时,应当删除该栈。当栈中没有元素或不存在该栈时,pop,popAt 应返回 -1.
示例1:
输入:
["StackOfPlates", "push", "push", "popAt", "pop", "pop"]
[[1], [1], [2], [1], [], []]
输出:
[null, null, null, 2, 1, -1]
示例2:
输入:
["StackOfPlates", "push", "push", "push", "popAt", "popAt", "popAt"]
[[2], [1], [2], [3], [0], [0], [0]]
输出:
[null, null, null, null, 2, 1, 3]
题解:
class StackOfPlates {
ArrayList<Stack<Integer>> collection = null;
int cap = 0;
public StackOfPlates(int cap) {
collection = new ArrayList();
this.cap = cap;
}
public void push(int val) {
if(cap <= 0) return;
int colSize = collection.size();
if(colSize > 0 && collection.get(colSize-1).size()+1 <= cap){
Stack<Integer> stack = collection.get(colSize-1);
stack.push(val);
}else{
Stack<Integer> stack = new Stack();
stack.push(val);
collection.add(stack);
}
}
public int pop() {
if(collection.size() <=0 || cap <= 0) return -1;
Stack<Integer> stack = collection.get(collection.size()-1);
int val = stack.pop();
if(stack.size() <= 0) collection.remove(stack);
return val;
}
public int popAt(int index) {
if(index < 0 || (index+1) > collection.size() || cap <= 0) return -1 ;
Stack<Integer> stack = collection.get(index);
int val = stack.pop();
if(stack.size() <= 0) collection.remove(stack);
return val;
}
}
/**
* Your StackOfPlates object will be instantiated and called as such:
* StackOfPlates obj = new StackOfPlates(cap);
* obj.push(val);
* int param_2 = obj.pop();
* int param_3 = obj.popAt(index);
*/