import java.util.*;
import java.util.Stack;
public class Solution {
Stack<Integer> stack1 = new Stack<Integer>();
Stack<Integer> stack2 = new Stack<Integer>();
public void push(int node) {
stack1.push(node);
}
public int pop() {
if(stack2.empty()){
while(stack1.size()>0){
int tem=stack1.pop();
stack2.push(tem);
}
}
if(stack2.size()==0){
throw new RuntimeException("queue is empty.");
}
return stack2.pop();
}
}
import java.util.Stack;
public class Solution {
Stack<Integer> stack1 = new Stack<Integer>();
Stack<Integer> stack2 = new Stack<Integer>();
public void push(int node) {
stack1.push(node);
}
public int pop() {
if(stack2.empty()){
while(stack1.size()>0){
int tem=stack1.pop();
stack2.push(tem);
}
}
if(stack2.size()==0){
throw new RuntimeException("queue is empty.");
}
return stack2.pop();
}
}