[leetcode]Implement Stack using Queues

原创 2015年11月20日 09:56:36

题目如下:

Implement the following operations of a stack using queues.

push(x) – Push element x onto stack.
pop() – Removes the element on top of the stack.
top() – Get the top element.
empty() – Return whether the stack is empty.
Notes:
You must use only standard operations of a queue – which means only push to back, peek/pop from front, size, and is empty operations are valid.
Depending on your language, queue may not be supported natively. You may simulate a queue by using a list or deque (double-ended queue), as long as you use only standard operations of a queue.
You may assume that all operations are valid (for example, no pop or top operations will be called on an empty stack).

就是对java中queue的复习,附上代码:

class MyStack {

    private Queue<Integer> myqueue;  

    MyStack(){
        myqueue = new LinkedList<Integer>();
    }

    // Push element x onto stack.
    public void push(int x) {
        Queue tmp = new LinkedList<Integer>();
        tmp.add(x);
        while(myqueue.size() != 0){
            int data = myqueue.poll();
            tmp.add(data);
        }
        myqueue = tmp;
    }

    // Removes the element on top of the stack.
    public void pop() {
        myqueue.poll();
    }

    // Get the top element.
    public int top() {
        return myqueue.peek();
    }

    // Return whether the stack is empty.
    public boolean empty() {
        return myqueue.size() == 0;
    }
}

题目链接:`https://leetcode.com/problems/implement-stack-using-queues/

版权声明:本文为博主原创文章,未经博主允许不得转载。

【LeetCode-面试算法经典-Java实现】【225-Implement Stack using Queues(用队列实现栈操作)】

【225-Implement Stack using Queues(用队列实现栈操作)】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】代码下载【https://github.co...

leetcode 225. Implement Stack using Queues

题目Implement the following operations of a stack using queues.push(x) – Push element x onto stack. p...

关于LeetCode中Implement Stack using Queues一题的理解

题目如下: Implement the following operations of a stack using queues. push(x) -- Push element x on...

[leetcode: Python]225. Implement Stack using Queues

题目: mplement the following operations of a stack using queues.push(x) – Push element x onto stack. ...
  • NXHYD
  • NXHYD
  • 2017年05月12日 12:54
  • 226

Leetcode225. Implement Stack using Queues

该题和232题类似,思想上差不多232题 原题 Implement the following operations of a stack using queues.push(x) – Push ...

LeetCode(36)- Implement Stack using Queues

题目:Implement the following operations of a stack using queues.push(x) -- Push element x onto stack. ...

【LeetCode】Implement Stack using Queues 解题报告

【题目】 Implement the following operations of a stack using queues. push(x) -- Push element x o...
  • ljiabin
  • ljiabin
  • 2015年06月14日 10:35
  • 8633

[LeetCode]225. Implement Stack using Queues

Implement the following operations of a stack using queues. push(x) -- Push element x onto stack....

Leetcode 225 Implement Stack using Queues 使用队列实现栈

使用队列来实现一个栈

Leetcode_252_Implement Stack using Queues

本文是在学习中的总结,欢迎转载但请注明出处:http://blog.csdn.net/pistolove/article/details/48598773 Implement the fo...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:[leetcode]Implement Stack using Queues
举报原因:
原因补充:

(最多只允许输入30个字)