[leetcode] 132.Implement Queue using Stacks

原创 2015年07月08日 13:57:16

题目:
Implement the following operations of a queue using stacks.

push(x) – Push element x to the back of queue.
pop() – Removes the element from in front of queue.
peek() – Get the front element.
empty() – Return whether the queue is empty.
Notes:
You must use only standard operations of a stack – which means only push to top, peek/pop from top, size, and is empty operations are valid.
Depending on your language, stack may not be supported natively. You may simulate a stack by using a list or deque (double-ended queue), as long as you use only standard operations of a stack.
You may assume that all operations are valid (for example, no pop or peek operations will be called on an empty queue).
题意:
使用栈来实现队列。
思路:
使用两个栈,一个用来push数据,另一个的作用是查看队列的最先进入的数据以及pop出第一个数据。
两个栈记为s1,s2,入队列时存入s1中,出队列时或者查看第一个元素时,查看s2中是否有元素,没有的话从s1中将元素放入到s2中,由于元素进入s1是1,2..n,而进入s2时是n…2,1所以接下来出s2的顺序就是进入s1的顺序。
以上,代码如下:

class Queue {
public:
    // Push element x to the back of queue.
    void push(int x) {
        s1.push(x);
    }

    // Removes the element from in front of queue.
    void pop(void) {
        if(s2.empty()) {
            if(s1.empty())return;
            while(!s1.empty()) {
                s2.push(s1.top());
                s1.pop();
            }
        }
        s2.pop();
    }

    // Get the front element.
    int peek(void) {
        if(s2.empty()) {
            if(s1.empty())return -1;
            while(!s1.empty()) {
                s2.push(s1.top());
                s1.pop();
            }
        }
        return s2.top();
    }

    // Return whether the queue is empty.
    bool empty(void) {
        return(!(!s1.empty() || !s2.empty()));
    }
    private:
    stack<int> s1;
    stack<int> s2;
};
版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

【leetcode】232. Implement Queue using Stacks

一、题目描述 Implement the following operations of a queue using stacks. push(x) -- Push element x...

LeetCode:Implement Queue using Stacks

LeetCode:Implement Queue using Stacks1、题目: Implement the following operations of a queue using stac...

LeetCode232 Implement Queue using Stacks Java 题解

题目: Implement the following operations of a queue using stacks. push(x) -- Push element x to...

LeetCode232—Implement Queue using Stacks

LeetCode232: Implement Queue using Stacks

LeetCode Implement Queue using Stacks

题目: Implement the following operations of a queue using stacks. push(x) -- Push element x to...

LeetCode 232: Implement Queue using Stacks

Implement the following operations of a queue using stacks. push(x) -- Push element x to the back...

LeetCode[232] Implement Queue using Stacks

Implement the following operations of a queue using stacks. push(x) -- Push element x to the back...

LeetCode 232. Implement Queue using Stacks(用栈实现队列)

原题网址:https://leetcode.com/problems/implement-queue-using-stacks/ mplement the following operations...

[Leetcode] 232. Implement Queue using Stacks 解题报告

题目: Implement the following operations of a queue using stacks. push(x) -- Push element x to...

leetcode Implement Queue using Stacks

继续刷题。编译CM12.1刷机怎么着都有问题,烦人的把之前下载的源码直接删掉,重新下载,在下载源码期间继续刷题,希望这个easy不要把我虐成狗。 其实主要问题是自己米有java基础知识,幸亏会点C,可...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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