leetcode225：用队列实现栈

用队列实现栈

题目

解题思路

代码示例

package com.example;

import java.util.LinkedList;
import java.util.Queue;

public class MyStack {
    /** Initialize your data structure here. */
    private Queue <Integer> queue;
    public MyStack() {
  queue= new LinkedList<Integer>();
    }

    /** Push element x onto stack. */
    public void push(int x) {
   queue.add(x);
    }

    /** Removes the element on top of the stack and returns that element. */
    public int pop() {
        int size=queue.size();
        for (int i = 0; i <size-1 ; i++) {
            Integer e=queue.remove();
            queue.add(e);
        }
        return queue.remove();
    }

    /** Get the top element. */
    public int top() {
int siez=queue.size();
        for (int i = 0; i <siez-1 ; i++) {
            Integer e =queue.remove();
            queue.add(e);
        }
        Integer temp=queue.remove();
        queue.add(temp);
        return  temp;
    }

    /** Returns whether the stack is empty. */
    public boolean empty() {
return queue.isEmpty();
    }
}