easy 剑指 Offer 用两个栈实现队列 汉诺塔

---

汉诺塔：

c++

class CQueue {
public:
    stack<int> stk1;
    stack<int> stk2;

    CQueue() {   //  创建队列  构造函数 定义一个类
    }
    
    void appendTail(int value) {   // 底部入队
        // 1->2
        while(!stk1.empty()){
            stk2.push(stk1.top());
            stk1.pop();
        }
        // stk1弹完,加value进stk1
        stk1.push(value);
        // 2->1
        // stk2 元素依次回 stk1, 则stk1 从顶到第，依次先进到后进
        while(!stk2.empty()){
            stk1.push(stk2.top());
            stk2.pop();
        }

    }
    
    int deleteHead() {   // 顶部出队
        if (stk1.empty()){
            return -1;
        }
        int temp = stk1.top();
        stk1.pop();
        return temp;
    }
};

python

class CQueue:

    def __init__(self):
        self.stk1 = []  # self. 使 class MinStack 都能用
        self.stk2 = []

    def appendTail(self, value: int) -> None:
        # 1->2
        while self.stk1:
            self.stk2.append(self.stk1[-1])
            self.stk1.pop()
        # value 进stk1
        self.stk1.append(value)
        # 2->1
        while self.stk2:
            self.stk1.append(self.stk2[-1])
            self.stk2.pop()

    def deleteHead(self) -> int:
        if not self.stk1:
            return -1
        temp = self.stk1[-1]
        self.stk1.pop()
        return temp

---