剑指 Offer 09. 用两个栈实现队列(java+python)

用两个栈实现一个队列。队列的声明如下，请实现它的两个函数 appendTail 和 deleteHead ，分别完成在队列尾部插入整数和在队列头部删除整数的功能。(若队列中没有元素，deleteHead 操作返回 -1 )

示例 1：

输入：
["CQueue","appendTail","deleteHead","deleteHead","deleteHead"]
[[],[3],[],[],[]]
输出：[null,null,3,-1,-1]

示例 2：

输入：
["CQueue","deleteHead","appendTail","appendTail","deleteHead","deleteHead"]
[[],[],[5],[2],[],[]]
输出：[null,-1,null,null,5,2]

提示：

• 1 <= values <= 10000

• 最多会对 appendTail、deleteHead 进行 10000 次调用

java

import java.util.LinkedList;
class CQueue {
        //LinkedList单链表 
        LinkedList<Integer> A=new LinkedList<Integer>();
        LinkedList<Integer> B=new LinkedList<Integer>();
    public CQueue() {
    }

    //直接入栈A即可
    public void appendTail(int value) {
        A.add(value);
    }
    
    // if B不为空，直接返回栈顶元素
    // else if AB都为空返回-1
    // else A全转B返回栈顶元素
    public int deleteHead() {
        if(!B.isEmpty()){
            return B.poll();
        }
        else if(A.isEmpty()&&B.isEmpty()){
            return -1;
        }
        else{
            while(!A.isEmpty()){
                B.add(A.poll());
            }
            return B.poll();
        }
    }
}

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

python3

class CQueue:

    def __init__(self):
        self.A=[]
        self.B=[]

    def appendTail(self, value: int) -> None:
        self.A.append(value)

    def deleteHead(self) -> int:
        if self.B!=[]:
            return self.B.pop()
        elif self.B==[] and self.A==[]:
            return -1
        else:
            while self.A!=[]:
                self.B.append(self.A.pop())
        return self.B.pop()
            



# Your CQueue object will be instantiated and called as such:
# obj = CQueue()
# obj.appendTail(value)
# param_2 = obj.deleteHead()