C++每日一练7.两个栈实现队列

Posted 2022-01-09 鱼酱2333

需求：两个栈实现一个队列

• 队列是FIFO 先进后出
• 栈是FILO 先进先出

class Solution

public:
    void push(int node) 
        stack1.push(node);
    
 
    int pop() 
        if (stack2.empty()) 
            while (!stack1.empty()) 
                stack2.push(stack1.top());
                stack1.pop();
            
        
        int ret = stack2.top();
        stack2.pop();
        return ret;
    
 
private:
    stack<int> stack1;
    stack<int> stack2;
;