Methods(functions) of Queue:
offer(E):boolean --Insert E into Queue
Poll(): E--Retrieve and removes the head of Queue
Peek(): E--Retrieve but not remove the head of Queue
在push函数上 新建一个新的queue存储现在queue上的元素,等poll空现在queue,把要push的元素offer进去,再把临时存储在新建queueli的元素依次offer进去
代码:
class MyStack {
// Push element x onto stack.
Queue<Integer> queue = new LinkedList<>();
Queue<Integer> aux = new LinkedList<>();
public void push(int x) {
//public Queue<Integer> aux = new Queue<>();
while(!queue.isEmpty()){
aux.offer(queue.poll());
}
queue.offer(x);
while(!aux.isEmpty()){
queue.offer(aux.poll());
}
}
// Removes the element on top of the stack.
public void pop() {
queue.poll();
}
// Get the top element.
public int top() {
return queue.peek();
}
// Return whether the stack is empty.
public boolean empty() {
return queue.isEmpty();
}
}