225. 用队列实现栈

225. 用队列实现栈

难度：简单
题目描述

解题思路

1、使用双端队列

双端队列好简单

public class MyStack {
	private Deque<Integer> deque;
	/** Initialize your data structure here. */
    public MyStack() {
    	deque = new LinkedList<>();
    }
    
    /** Push element x onto stack. */
    public void push(int x) {
    	deque.addLast(x);
    }
    
    /** Removes the element on top of the stack and returns that element. */
    public int pop() {
    	return deque.removeLast();
    }
    
    /** Get the top element. */
    public int top() {
    	return deque.getLast();
    }
    
    /** Returns whether the stack is empty. */
    public boolean empty() {
    	return deque.isEmpty();
    }
}

/**
 * Your MyStack object will be instantiated and called as such:
 * MyStack obj = new MyStack();
 * obj.push(x);
 * int param_2 = obj.pop();
 * int param_3 = obj.top();
 * boolean param_4 = obj.empty();
 */

2、使用普通队列

因为队列是先进先出，栈是后进先出，为了满足栈的特征，可以在入队的时候，把队列里其它元素依次出队再入队，这样能保证每个入队的元素都再队头，然后出队的时候达到出栈后进先出的效果

public class MyStack {
	private Queue<Integer> queue;
	/** Initialize your data structure here. */
    public MyStack() {
    	queue = new LinkedList<>();
    }
    
    /** Push element x onto stack. */
    public void push(int x) {
    	queue.add(x);
    	for (int i = 0; i < queue.size()-1; i++) {
			queue.add(queue.poll());
		}
    }
    
    /** Removes the element on top of the stack and returns that element. */
    public int pop() {
    	return queue.poll();
    }
    
    /** Get the top element. */
    public int top() {
    	return queue.peek();
    }
    
    /** Returns whether the stack is empty. */
    public boolean empty() {
    	return queue.isEmpty();
    }
}