題目描述

解題代碼

import java.util.Stack;

public class Solution{
    Stack<Integer> in = new Stack<>();
    Stack<Integer> out = new Stack<>();
    
    public void push(int node){
        in.push(node);
    }
    
    public
 
 int pop(){
        if(out.isEmpty())
            while(!in.isEmpty())
                out.push(in.pop());
        return out.pop();
    }
}

劍指offer 05：用兩個棧實現隊列