LeetCode|Implement Stack using Queues

最新推荐文章于 2024-05-01 20:01:28 发布

DouMiaoO_Oo

最新推荐文章于 2024-05-01 20:01:28 发布

阅读量326

点赞数

分类专栏：数据结构 | 算法 LeetCode 文章标签： leetcode stack queues

本文链接：https://blog.csdn.net/DouMiaoO_Oo/article/details/51205565

版权

LeetCode 同时被 2 个专栏收录

73 篇文章 0 订阅

订阅专栏

数据结构 | 算法

49 篇文章 0 订阅

订阅专栏

Implement Stack using Queues

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

class Stack {
public:
    // Push element x onto stack.
    void push(int x) {
        if(q1.empty()){
            Q1 = &q1;
            Q2 = &q2;
        } else {
            Q1 = &q2;
            Q2 = &q1;
        }
        Q1->push(x);
        while(!Q2->empty()){
            Q1->push(Q2->front());
            Q2->pop();
        }

    }

    // Removes the element on top of the stack.
    void pop() {
        if(q1.empty()){
           q2.pop();
        } else {
           q1.pop();
        }
    }

    // Get the top element.
    int top() {
        if(q1.empty()){
           return q2.front();
        } else {
           return q1.front();
        }
    }

    // Return whether the stack is empty.
    bool empty() {
        return q1.empty() && q2.empty();
    }
    queue<int> q1, q2;
    queue<int> *Q1, *Q2;
};