# Implement Stack using Queues leetcode

2022年11月23日
0 收藏 735 点赞 3,681 浏览 1014 个字

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.

`class Stack {public:    // Push element x onto stack.    void push(int x) {        que1.push(x);    }    // Removes the element on top of the stack.    void pop() {        while (que1.size() > )        {            que2.push(que1.front());            que1.pop();        }        que1.pop();        while (!que2.empty())        {            que1.push(que2.front());            que2.pop();        }    }    // Get the top element.    int top() {        return que1.back();    }    // Return whether the stack is empty.    bool empty() {        return que1.empty();    }private:    queue<int> que1;    queue<int> que2;};`

push 1

1

push 2

2 1

push 3

3 2 1

`class Stack {public:    queue<int> que;    // Push element x onto stack.    void push(int x) {        que.push(x);        for (int i = ; i<que.size() - ; ++i) {            que.push(que.front());            que.pop();        }    }    // Removes the element on top of the stack.    void pop() {        que.pop();    }    // Get the top element.    int top() {        return que.front();    }    // Return whether the stack is empty.    bool empty() {        return que.empty();    }};`

python开发_常用的python模块及安装方法

Educational Codeforces Round 11 C. Hard Process 二分
C. Hard Process题目连接：http://www.codeforces.com/contest/660/problem/CDes…

zengkefu@server1:/usr/src\$ uname -aLinux server1 4.10.0-19-generic #21…

Android调用系统相机、自定义相机、处理大图片
Android调用系统相机和自定义相机实例本博文主要是介绍了android上使用相机进行拍照并显示的两种方式，并且由于涉及到要把拍到的照片显…

Struts的使用