232. Implement Queue using Stacks

class MyQueue {
Queue<Integer> stack = new LinkedList<>();
// Push element x to the back of queue.
public void push(int x) {
Queue<Integer> temp = new LinkedList<>();
while(!stack.isEmpty())
{
temp.add(stack.poll());
}
temp.add(x);
while(!temp.isEmpty())
{
stack.add(temp.poll());
}
}
// Removes the element from in front of queue.
public void pop() {
stack.poll();
}
// Get the front element.
public int peek() {
return stack.peek();
}
// Return whether the queue is empty.
public boolean empty() {
return stack.isEmpty();
}
}