0
点赞
收藏
分享

微信扫一扫

两个栈组成队列

干自闭 2022-01-16 阅读 71
import java.util.Stack;

public class Dui01 {
    private Stack<Integer> stack1=new Stack<>();
    private Stack<Integer> stack2=new Stack<>();
    public void add(int x){
        stack1.push(x);
    }
    public Integer get(){
        Integer re=null;
        if(!stack2.empty()){
            re=stack2.pop();
        }else{
            while(!stack1.empty()){
                re=stack1.pop();
                stack2.push(re);
            }
            if(!stack2.empty()){
                re=stack2.pop();
            }
        }
        return re;
    }
}
举报

相关推荐

0 条评论