232 - Implement Queue using Stacks

最新推荐文章于 2022-04-18 21:48:00 发布

原创最新推荐文章于 2022-04-18 21:48:00 发布 · 545 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

LeetCode 专栏收录该内容

18 篇文章

订阅专栏

本文介绍了一种利用栈来实现队列的方法，并提供了一个具体的C++实现案例。该方法通过两个栈来模拟队列的基本操作，包括入队、出队、获取队首元素及判断队列是否为空。

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).

实现如下：

class Queue {
public:
         stack<int> A, B;
        void push(int x) {
                A.push(x);
        }

        void pop(void) {
                while(!A.empty()) {
                        B.push(A.top());
                        A.pop();
                }
                B.pop();
                while(!B.empty()) {
                        A.push(B.top());
                        B.pop();
                }
        }

        int peek(void) {
                if( !A.empty() ) {
                        while(!A.empty()) {
                                B.push(A.top());
                                A.pop();
                        }
                        int p = B.top();
                        while(!B.empty()) {
                                A.push(B.top());
                                B.pop();
                        }
                        return p;
                }
                return 0;
        }

        bool empty(void) {
                return A.empty();
        }
};

int main() {
        Queue queue;
        queue.push(1);
        queue.push(2);
        queue.push(3);
        while(!queue.empty()) {
                cout << queue.peek();
                queue.pop();
        }
        //queue.pop();
        cout << queue.peek() << endl;
        if(queue.empty() == true)
                cout << "empty" << endl;
        else
                cout << "not empty" << endl;
        return 0;
}