import java.util.ArrayDeque;

import java.util.Deque;

/**

* Author : WindAsMe

* File : MyStack.java

* Time : Create on 18-6-7

* Location : ../Home/JavaForLeeCode2/MyStack.java

* Function : LeeCode No.225

*/

public class MyStack {

private Deque<Integer> queue;

/** Initialize your data structure here. */

public MyStack() {

queue = new ArrayDeque<>();

}

/** Push element x onto stack. */

public void push(int x) {

queue.push(x);

}

/** Removes the element on top of the stack and returns that element. */

public int pop() {

return queue.pop();

}

/** Get the top element. */

public int top() {

return queue.peek();

}

/** Returns whether the stack is empty. */

public boolean empty() {

return queue.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();

*/