《剑指offer》第四题(用两个栈实现队列)

描述:

  用两个栈实现队列。栈的特征就是先进后出。队列的特性就是先进先出。
  代码:

package cn.wzq.sword_finger_offer;

import java.util.Stack;

public class Sword04 {

    /*
     * 两个栈实现队列
     */

    Stack stackIn = new Stack();
    Stack stackOut = new Stack();

    public void push(int value) {
        stackIn.push(value);
    }

    public int pop() {
        if (stackOut.empty()) {
            while (!stackIn.empty()) {
                int value = (int) stackIn.pop();
                stackOut.push(value);
                /*System.out.println(value);*/
            }
        }
        int outValue = (int) stackOut.pop();
        return outValue;
    }

    public boolean isEmple() {
        System.out.println(stackOut.empty());
        return stackOut.empty();
    }

    public static void main(String arg[]) {
        Sword04 sword = new Sword04();
        sword.push(1);
        sword.push(2);
        sword.push(3);
        sword.push(4);
        sword.push(5);

        System.out.println(sword.pop());
        System.out.println(sword.pop());
        System.out.println(sword.pop());
        System.out.println(sword.pop());
        System.out.println(sword.pop());


    }
}

你可能感兴趣的:(《剑指offer》第四题(用两个栈实现队列))