From 2df651a1358066246a72f3697dd04407628261d8 Mon Sep 17 00:00:00 2001
From: asiL-tcefreP <1626680964@qq.com>
Date: Sat, 29 Oct 2022 13:54:57 -0400
Subject: [PATCH 1/2] =?UTF-8?q?Update=200084.=E6=9F=B1=E7=8A=B6=E5=9B=BE?=
 =?UTF-8?q?=E4=B8=AD=E6=9C=80=E5=A4=A7=E7=9A=84=E7=9F=A9=E5=BD=A2.md=20(Ja?=
 =?UTF-8?q?va=E7=89=88=E6=9C=AC)?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0084.柱状图中最大的矩形.md | 12 ++++++------
 1 file changed, 6 insertions(+), 6 deletions(-)

diff --git a/problems/0084.柱状图中最大的矩形.md b/problems/0084.柱状图中最大的矩形.md
index 220b096e..bcb0915e 100644
--- a/problems/0084.柱状图中最大的矩形.md
+++ b/problems/0084.柱状图中最大的矩形.md
@@ -206,7 +206,7 @@ class Solution {
     public int largestRectangleArea(int[] heights) {
         int length = heights.length;
         int[] minLeftIndex = new int [length];
-        int[] maxRigthIndex = new int [length];
+        int[] minRightIndex = new int [length];
         // 记录左边第一个小于该柱子的下标
         minLeftIndex[0] = -1 ;
         for (int i = 1; i < length; i++) {
@@ -215,17 +215,17 @@ class Solution {
             while (t >= 0 && heights[t] >= heights[i]) t = minLeftIndex[t];
             minLeftIndex[i] = t;
         }
-        // 记录每个柱子 右边第一个小于该柱子的下标
-        maxRigthIndex[length - 1] = length;
+        // 记录每个柱子右边第一个小于该柱子的下标
+        minRightIndex[length - 1] = length;
         for (int i = length - 2; i >= 0; i--) {
             int t = i + 1;
-            while(t < length && heights[t] >= heights[i]) t = maxRigthIndex[t];
-            maxRigthIndex[i] = t;
+            while(t < length && heights[t] >= heights[i]) t = minRightIndex[t];
+            minRightIndex[i] = t;
         }
         // 求和
         int result = 0;
         for (int i = 0; i < length; i++) {
-            int sum = heights[i] * (maxRigthIndex[i] - minLeftIndex[i] - 1);
+            int sum = heights[i] * (minRightIndex[i] - minLeftIndex[i] - 1);
             result = Math.max(sum, result);
         }
         return result;

From 309b49cf47699554a928354e2621575ec524db2f Mon Sep 17 00:00:00 2001
From: fw_qaq <82551626+Jack-Zhang-1314@users.noreply.github.com>
Date: Mon, 31 Oct 2022 10:59:59 +0800
Subject: [PATCH 2/2] =?UTF-8?q?update=201047.=E5=88=A0=E9=99=A4=E5=AD=97?=
 =?UTF-8?q?=E7=AC=A6=E4=B8=B2=E4=B8=AD=E7=9A=84=E6=89=80=E6=9C=89=E7=9B=B8?=
 =?UTF-8?q?=E9=82=BB=E9=87=8D=E5=A4=8D=E9=A1=B9.md=20about=20rust?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...除字符串中的所有相邻重复项.md | 19 +++++++++++++++++++
 1 file changed, 19 insertions(+)

diff --git a/problems/1047.删除字符串中的所有相邻重复项.md b/problems/1047.删除字符串中的所有相邻重复项.md
index 849b5e79..ad729298 100644
--- a/problems/1047.删除字符串中的所有相邻重复项.md
+++ b/problems/1047.删除字符串中的所有相邻重复项.md
@@ -447,6 +447,25 @@ object Solution {
 }
 ```
 
+rust:
+
+```rust
+impl Solution {
+    pub fn remove_duplicates(s: String) -> String {
+        let mut stack = vec![];
+        let mut chars: Vec<char> = s.chars().collect();
+        while let Some(c) = chars.pop() {
+            if stack.is_empty() || stack[stack.len() - 1] != c {
+                stack.push(c);
+            } else {
+                stack.pop();
+            }
+        }
+        stack.into_iter().rev().collect()
+    }
+}
+```
+
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">
   <img src="../pics/网站星球宣传海报.jpg" width="1000"/>