剑指 Offer 09. 用两个栈实现队列

https://leetcode-cn.com/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof/

class CQueue {
    Stack<Integer> s1;
    Stack<Integer> s2;
    public CQueue() {
      s1 = new Stack<>();
      s2 = new Stack<>();
    }
    
    public void appendTail(int value) {
       s1.push(value);
    }
    
    public int deleteHead() {
        if(s2.isEmpty()){
            while(!(s1.isEmpty())){
                s2.push(s1.pop());
            }
        }
        if(s2.isEmpty()){
            return -1;
        }else{
            return s2.pop();
        }
    }
}

/**
 * Your CQueue object will be instantiated and called as such:
 * CQueue obj = new CQueue();
 * obj.appendTail(value);
 * int param_2 = obj.deleteHead();
 */