算法第四版1.4算法分析：习题1.4.31

组成：headstack,tailstack,tempstack

headstack的栈底为队列的头，栈顶与tailstack的栈底相连，tailstack的栈顶为队列的尾。

pushLeft()：放在headstack的最底部。若headstack为空，直接入栈，若不为空，全部倒入tempstack，入栈新元素

pushRight()：直接压入tailstack

popLeft()：将headstack全部弹出压入tempstack,tempstack弹出一个元素；若tempstack为空，将tailstack所有元素弹出压入tempstack，弹出一个元素

popRight()：弹出tailstack栈顶元素，若tailstack为空，将tempstack全部压入headstack，弹出headstack栈顶元素

tempstack主要是与headstack作交互，tempstack可以push headstack的元素，也可以push tailstack的元素，但是pop的元素只进入headstack;因为tailstack的元素本来就是接在headstack后的，pop到tempstack之后，不如直接push到headstack

import edu.princeton.cs.algs4.StdOut;

public class E1_4_31 {
    public static void main(String[]args){
        Deque<Integer> deque=new Deque<>();
        for (int i=5;i<10;i++)
            deque.pushRight(i);
        for (int i=0;i<4;i++)//右边出四个，结果应该为9，8，7，6
            StdOut.print(deque.popRight()+"  ");
        StdOut.println();
        for (int i=4;i>=0;i--)
            deque.pushLeft(i);
        while (!deque.isEmpty())//左边出完，0，1，2，3，4，5
            StdOut.print(deque.popLeft()+"  ");
    }

    public static class Deque<Item>{
        Stack<Item> headStack=new Stack<>();
        Stack<Item> tailStack=new Stack<>();
        Stack<Item> tempStack=new Stack<>();

        public boolean isEmpty(){return size()==0;}
        public int size(){return headStack.size()+tailStack.size()+tempStack.size();}
        public void pushLeft(Item item){
            if (headStack.isEmpty());
            else
                while (!headStack.isEmpty())
                    tempStack.push(headStack.pop());
            headStack.push(item);
        }
        public void pushRight(Item item){
            tailStack.push(item);
        }
        public Item popLeft(){
            if (isEmpty())return null;
            if (headStack.size()+tempStack.size()!=0)
                while (!headStack.isEmpty())
                    tempStack.push(headStack.pop());
            else
                while (!tailStack.isEmpty())
                    tempStack.push(tailStack.pop());
            return tempStack.pop();
        }
        public Item popRight(){
            if (isEmpty())return null;
            if (!tailStack.isEmpty())
                return tailStack.pop();
            else {
                while (!tempStack.isEmpty())
                    headStack.push(tempStack.pop());
                return headStack.pop();
            }
        }
    }
}

Stack的实现前面有。