Merge pull request chefyuan#23 from coderhare/main

chefyuan · web-flow · commit 3081abf29867 · 2021-05-06T13:40:05.000+08:00
Lc 255, 1047更新cpp代码
diff --git a/animation-simulation/栈和队列/225.用队列实现栈.md b/animation-simulation/栈和队列/225.用队列实现栈.md
@@ -18,6 +18,8 @@
 
 下面我们来看一下题目代码，也是很容易理解。
 
+#### 题目代码
+
 Java Code:
 ```java
 class MyStack {
@@ -87,3 +89,32 @@ MyStack.prototype.empty = function() {
 };
 ```
 
+C++ Code:
+
+```cpp
+class MyStack {
+    queue <int> q;
+public:    
+    void push(int x) {
+        q.push(x);
+        for(int i = 1;i < q.size();i++){
+            int val = q.front();
+            q.push(val);
+            q.pop();
+        }
+    }
+
+    int pop() {
+        int val = q.front();
+        q.pop();
+        return val;
+    }
+    int top() {
+        return q.front();
+    }  
+    bool empty() {
+        return q.empty();
+    }
+};
+```
+
diff --git a/animation-simulation/栈和队列/leetcode1047 删除字符串中的所有相邻重复项.md b/animation-simulation/栈和队列/leetcode1047 删除字符串中的所有相邻重复项.md
@@ -29,9 +29,11 @@
 
 
 
+**题目代码**
 
 
 
+Java Code:
 
 ```java
 class Solution {
@@ -67,3 +69,27 @@ class Solution {
 ```
 
 当然这个题目也可以用 set 来做，大家可以随意发挥
+
+C++ Code:
+
+```cpp
+class Solution {
+public:
+string removeDuplicates(string S) {
+         string str;
+         if (S.empty() || S.size() == 1) {
+             return S;
+         }
+         for (int i = 0; i<S.size(); i++) {
+             if(str.empty() || S[i] != str.back()) {                
+                 str.push_back(S[i]);
+             }
+             else {
+                 str.pop_back();
+             }
+         }
+         return str;
+    }
+};
+```
+
