新增 LeetCode 225 用队列实现栈的 C++ 实现，包含基本操作的代码

Author: tkzzzzzz6

book/代码随想录/栈和队列/225. 用队列实现栈/1.cpp

@@ -0,0 +1,102 @@
+/*
+ * @Author: tkzzzzzz6
+ * @Date: 2026-04-14 15:13:11
+ * @LastEditors: tkzzzzzz6
+ * @LastEditTime: 2026-04-14 21:14:52
+ */
+/*
+ * @lc app=leetcode.cn id=225 lang=cpp
+ * @lcpr version=30204
+ *
+ * [225] 用队列实现栈
+ */
+
+
+// @lcpr-template-start
+using namespace std;
+#include <algorithm>
+#include <array>
+#include <bitset>
+#include <climits>
+#include <deque>
+#include <functional>
+#include <iostream>
+#include <list>
+#include <queue>
+#include <stack>
+#include <tuple>
+#include <unordered_map>
+#include <unordered_set>
+#include <utility>
+#include <vector>
+// @lcpr-template-end
+// @lc code=start
+class MyStack {
+public:
+    queue<int> q1,q2; //q2用于备份
+    MyStack() {
+        
+    }
+    
+    void push(int x) {
+        q1.push(x);
+    }
+    
+    int pop() {
+        int n = q1.size();
+        if(n < 1)return -1;
+        --n;
+        while(n--){
+            q2.push(q1.front());
+            q1.pop();
+        }
+
+        int res = q1.front();
+        q1.pop();
+
+        q1 = q2;
+        while(!q2.empty())q2.pop();
+        return res;
+    }
+    
+    int top() {
+        int n = q1.size();
+        if(n < 1)return -1;
+        --n;
+        while(n--){
+            q2.push(q1.front());
+            q1.pop();
+        }
+
+        int res = q1.front();
+        q2.push(q1.front());
+
+        q1 = q2;
+        while(!q2.empty())q2.pop();
+        return res;
+    }
+    
+    bool empty() {
+        return q1.empty();
+    }
+};
+
+/**
+ * Your MyStack object will be instantiated and called as such:
+ * MyStack* obj = new MyStack();
+ * obj->push(x);
+ * int param_2 = obj->pop();
+ * int param_3 = obj->top();
+ * bool param_4 = obj->empty();
+ */
+// @lc code=end
+
+
+
+/*
+// @lcpr case=start
+// ["MyStack", "push", "push", "top", "pop", "empty"][[], [1], [2], [], [], []]\n
+// @lcpr case=end
+
+ */
+

book/代码随想录/栈和队列/225. 用队列实现栈/2.cpp

@@ -0,0 +1,97 @@
+/*
+ * @Author: tkzzzzzz6
+ * @Date: 2026-04-14 15:13:11
+ * @LastEditors: tkzzzzzz6
+ * @LastEditTime: 2026-04-14 21:35:34
+ */
+/*
+ * @lc app=leetcode.cn id=225 lang=cpp
+ * @lcpr version=30204
+ *
+ * [225] 用队列实现栈
+ */
+
+//  使用单个队列实现
+
+// @lcpr-template-start
+using namespace std;
+#include <algorithm>
+#include <array>
+#include <bitset>
+#include <climits>
+#include <deque>
+#include <functional>
+#include <iostream>
+#include <list>
+#include <queue>
+#include <stack>
+#include <tuple>
+#include <unordered_map>
+#include <unordered_set>
+#include <utility>
+#include <vector>
+// @lcpr-template-end
+// @lc code=start
+class MyStack {
+public:
+    queue<int> q1; 
+    MyStack() {
+        
+    }
+    
+    void push(int x) {
+        q1.push(x);
+    }
+    
+    int pop() {
+        int n = q1.size();
+        if(n < 1)return -1;
+        --n;
+        while(n--){
+            q1.push(q1.front());
+            q1.pop();
+        }
+
+        int res = q1.front();
+        q1.pop();
+        return res;
+    }
+    
+    int top() {
+        int n = q1.size();
+        if(n < 1)return -1;
+        --n;
+        while(n--){
+            q1.push(q1.front());
+            q1.pop();
+        }
+
+        int res = q1.front();
+        q1.push(q1.front());
+        q1.pop();
+        return res;
+    }
+    
+    bool empty() {
+        return q1.empty();
+    }
+};
+
+/**
+ * Your MyStack object will be instantiated and called as such:
+ * MyStack* obj = new MyStack();
+ * obj->push(x);
+ * int param_2 = obj->pop();
+ * int param_3 = obj->top();
+ * bool param_4 = obj->empty();
+ */
+// @lc code=end
+
+
+
+/*
+// @lcpr case=start
+// ["MyStack", "push", "push", "top", "pop", "empty"][[], [1], [2], [], [], []]\n
+// @lcpr case=end
+
+ */

leetcode/Study Plan/225. 用队列实现栈/1.cpp

@@ -0,0 +1,101 @@
+/*
+ * @Author: tkzzzzzz6
+ * @Date: 2026-04-14 15:13:11
+ * @LastEditors: tkzzzzzz6
+ * @LastEditTime: 2026-04-14 15:59:39
+ */
+/*
+ * @lc app=leetcode.cn id=225 lang=cpp
+ * @lcpr version=30204
+ *
+ * [225] 用队列实现栈
+ */
+
+
+// @lcpr-template-start
+using namespace std;
+#include <algorithm>
+#include <array>
+#include <bitset>
+#include <climits>
+#include <deque>
+#include <functional>
+#include <iostream>
+#include <list>
+#include <queue>
+#include <stack>
+#include <tuple>
+#include <unordered_map>
+#include <unordered_set>
+#include <utility>
+#include <vector>
+// @lcpr-template-end
+// @lc code=start
+class MyStack {
+public:
+    queue<int> q1,q2; //q2用于备份
+    MyStack() {
+        
+    }
+    
+    void push(int x) {
+        q1.push(x);
+    }
+    
+    int pop() {
+        int n = q1.size();
+        if(n < 1)return -1;
+        --n;
+        while(n--){
+            q2.push(q1.front());
+            q1.pop();
+        }
+
+        int res = q1.front();
+        q1.pop();
+
+        q1 = q2;
+        while(!q2.empty())q2.pop();
+        return res;
+    }
+    
+    int top() {
+        int n = q1.size();
+        if(n < 1)return -1;
+        --n;
+        while(n--){
+            q2.push(q1.front());
+            q1.pop();
+        }
+
+        int res = q1.front();
+        q2.push(q1.front());
+
+        q1 = q2;
+        while(!q2.empty())q2.pop();
+        return res;
+    }
+    
+    bool empty() {
+        return q1.empty();
+    }
+};
+
+/**
+ * Your MyStack object will be instantiated and called as such:
+ * MyStack* obj = new MyStack();
+ * obj->push(x);
+ * int param_2 = obj->pop();
+ * int param_3 = obj->top();
+ * bool param_4 = obj->empty();
+ */
+// @lc code=end
+
+
+
+/*
+// @lcpr case=start
+// ["MyStack", "push", "push", "top", "pop", "empty"][[], [1], [2], [], [], []]\n
+// @lcpr case=end
+
+ */