参看博客:http://www.imooc.com/article/1515
但是代码在两个队列实现一个栈的时候代码存在问题
正确代码如下:
import java.util.Queue;
import java.util.concurrent.ArrayBlockingQueue;
import java.util.concurrent.LinkedBlockingQueue;
public class Myqueue {
private Queue<Integer> queue1 = new LinkedBlockingQueue<>() ;
private Queue<Integer> queue2 = new LinkedBlockingQueue<>() ;
public void push(int data){
queue1.add(data);
}
public int pop() throws Exception{
int data;
if(queue1.size() == 0){
throw new Exception("栈为空");
}
while(queue1.size() != 0){
if(queue1.size() == 1){
data = queue1.poll();
while(queue2.size()!=0){
queue1.add(queue2.poll());
}
return data;
}
queue2.add(queue1.poll());
}
throw new Exception("栈为空");
}
public static void main(String[] args) throws Exception {
// TODO Auto-generated method stub
Myqueue qu = new Myqueue();
qu.push(1);
qu.push(2);
qu.push(3);
int data = qu.pop();
int data1 =qu.pop();
int data2 =qu.pop();
System.out.println(data);
System.out.println(data1);
System.out.println(data2);
}
}
程序的运行结果是:
3
2
1
import java.util.Queue;import java.util.concurrent.ArrayBlockingQueue;import java.util.concurrent.LinkedBlockingQueue;
public class Myqueue {
private Queue<Integer> queue1 = new LinkedBlockingQueue<>() ;private Queue<Integer> queue2 = new LinkedBlockingQueue<>() ;public void push(int data){queue1.add(data);}public int pop() throws Exception{int data;if(queue1.size() == 0){throw new Exception("栈为空");}while(queue1.size() != 0){if(queue1.size() == 1){data = queue1.poll();while(queue2.size()!=0){queue1.add(queue2.poll());}return data;}queue2.add(queue1.poll());}throw new Exception("栈为空");}public static void main(String[] args) throws Exception {// TODO Auto-generated method stub Myqueue qu = new Myqueue(); qu.push(1); qu.push(2); qu.push(3); int data = qu.pop(); int data1 =qu.pop(); int data2 =qu.pop(); System.out.println(data); System.out.println(data1); System.out.println(data2); }}