队列实现栈栈实现队列

        队列是一种先进先出的数据结构,要想实现先进后出,需加一个辅助队列进行数据的来回倒（引用交换）从而实现栈结构。

    例如: --5--4--3--2--1-> 用一个辅助队列装 4-3-2-1,把5弹出,在把 4-3-2-1放回原队列,如此反复可变成5-4-3-2-1的栈结构。

        栈是一种先进后出的数据结构,要想实现先进先出，同样也是准备2个栈,比如数据时  5-4-3-2-1->要想实现 1-2-3-4-5的出栈结构,可以在5-4-3-2-1弹出到另一个栈-1-2-3-4-5,在从另一个弹出即是1-2-3-4-5先进先出的顺序弹出从而实现队列结构.

       Coding:

        public class Code_StackAndQueueConvert {

// 两个栈实现队列
public static class TwoStacksQueue {
private Stack<Integer> stackPush;

private Stack<Integer> stackPop;

public TwoStacksQueue() {
stackPush = new Stack<Integer>();
stackPop = new Stack<Integer>();
}


public void push(int pushInt) {
stackPush.push(pushInt);
}


public int Poll() {
if (stackPop.empty() && stackPush.empty()) {
throw new RuntimeException("Queue is empty");


} else if (stackPop.empty()) {
while (!stackPush.empty()) {
stackPop.push(stackPush.pop());
}
}
return stackPop.pop();
}

public int peek() {
if (stackPop.empty() && stackPush.empty()) {
throw new RuntimeException("Queue is empty!");
} else if (stackPop.empty()) {
while (!stackPush.empty()) {
stackPop.push(stackPush.pop());
}
}
return stackPop.peek();

}

}

// 两个队列实现栈
public static class TwoQueuesStack {
private Queue<Integer> queue;
private Queue<Integer> help;

public TwoQueuesStack() {
queue = new LinkedList<Integer>();
help = new LinkedList<Integer>();

}


public void push(int pushInt) {
queue.add(pushInt);
}

public int peek() {
if (queue.isEmpty()) {
throw new RuntimeException("stack is empty");
}
while (queue.size() != -1) {
help.add(queue.poll());
}
int res = queue.poll();
help.add(res);
swap();
return res;
}

public int pop() {
if (queue.isEmpty()) {
throw new RuntimeException("Stack is empty!");
}
while (queue.size() != -1) {
help.add(queue.poll());
}
int res = queue.poll();
swap();
return res;
}

private void swap() {
Queue<Integer> temp = help;
help = queue;
queue = temp;
}
}
}