##面试的季节又要到了 拿去送给面试官 哈哈
##感谢这位大哥https://blog.csdn.net/qq_37186247/article/details/83475955
package com.test.scheme;
import java.util.LinkedList;
import java.util.Queue;
/**
* @Package: com.test.scheme
* @ClassName: QueueToStack2
* @Description: 类描述
* @Author: bulingfeng
* @CreateDate: 2019/2/27/027 14:27
*/
public class QueueToStack2<E> {
private Queue<E> queue1=new LinkedList<>();
private Queue<E> queue2=new LinkedList<>();
public boolean add(E e){
queue1.add(e);
return true;
}
public E peek() throws Exception {
//取出栈顶的数据 不移除
if (queue1.size()<=0){
throw new Exception("栈为空");
}
while ((queue1.size()-1)>0){
queue2.add(queue1.poll());
}
E result=queue1.poll();
queue2.add(result);
swap();
return result;
}
public void swap(){
Queue<E> temp=null;
temp=queue1;
queue1=queue2;
queue2=temp;
}
public E poll() throws Exception {
//去栈顶的数据 并且移除
if (queue1.size()<=0){
throw new Exception("栈为空");
}
while ((queue1.size()-1)>0){
queue2.add(queue1.poll());
}
E result=queue1.poll();
// queue1=queue2; 直接交换会出现问题 自己体会 哈哈
swap();
return result;
}
public static void main(String[] args) throws Exception {
QueueToStack queueToStack=new QueueToStack();
queueToStack.add("1");
queueToStack.add("2");
queueToStack.add("3");
System.out.println(queueToStack.peek());
System.out.println(queueToStack.poll());
System.out.println(queueToStack.poll());
}
}