import java.util.*;
//ä¸¤ä¸ªæ ˆç»„æˆä¸€ä¸ªé˜Ÿåˆ—
//
//æ ¸å¿ƒæ€æƒ³
//1ã€å‡†å¤‡ä¸¤ä¸ªæ ˆï¼Œ
// 一个用于æ£å¸¸å…¥æ ˆpushStack
// ä¸€ä¸ªç”¨äºŽå‡ºæ ˆpopStack
//2ã€å…¥æ ˆæ“作全部压入pushStackæ ˆ
//3ã€å‡ºæ ˆçš„时候，需è¦æ³¨æ„如下两点：
// 3.1 如果popStack为空，就需è¦ä¸€æ¬¡æ€§å°†pushStackæ ˆçš„æ•°æ®å…¨éƒ¨å‡ºæ ˆï¼Œå¹¶åŽ‹å…¥popStack
// 3.2 å¦åˆ™ï¼Œç›´æŽ¥ä»ŽpopStackå‡ºæ ˆ
//
public class TwoStackForQueue{
Stack pushStack = new Stack();
Stack popStack = new Stack();
//对数器æ£å¸¸çš„队列
Queue queue = new LinkedList();
public void push(int v){
pushStack.push(v);
}
public void pushQueue(int v){
queue.offer(v);
}
public void popQueue(){
queue.poll();
}
public int pop(){
if(!popStack.isEmpty()){
return popStack.pop();
}else{
while(!pushStack.isEmpty()){
popStack.push(pushStack.pop());
}
if(popStack.isEmpty()) return -1;
return popStack.pop();
}
}
public Boolean isEmpty(){
return popStack.isEmpty() && pushStack.isEmpty();
}
public Queue getQueue(){
return queue;
}
public Boolean isTrue(){
int max = 100000;
int optionsCount = 10000;
for (int j=0;j< max;j++ ) {
TwoStackForQueue queue = new TwoStackForQueue();
for (int i=0; i _queue = queue.getQueue();
while(!_queue.isEmpty()){
int v = _queue.poll();
int v1 = queue.pop();
if(v!=v1) return false;
}
if(!queue.isEmpty()) return false;
}
return true;
}
public static void main(String[] args){
TwoStackForQueue queue = new TwoStackForQueue();
System.out.print("测试结果："+queue.isTrue());
}
}