剑指 Offer 09. 用两个栈实现队列
class CQueue {
int[] q = new int[10001];
int hh = 0 , tt = -1;
public CQueue() {
}
public void appendTail(int value) {
q[++tt] = value;
}
public int deleteHead() {
if(tt<hh)return -1;
return q[hh++];
}
}
/**
* Your CQueue object will be instantiated and called as such:
* CQueue obj = new CQueue();
* obj.appendTail(value);
* int param_2 = obj.deleteHead();
*/