From 3f428289b2d6cc2cd75b163d1127ff374f7de116 Mon Sep 17 00:00:00 2001
From: fwqaaq <fwqaaq@gmail.com>
Date: Sat, 5 Aug 2023 15:55:18 +0800
Subject: [PATCH] =?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?=
 =?UTF-8?q?=E4=BB=A3=E7=A0=81=E9=87=8D=E5=A4=8D?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0084.柱状图中最大的矩形.md b/problems/0084.柱状图中最大的矩形.md
index 9b76229a..9fb6a6b0 100644
--- a/problems/0084.柱状图中最大的矩形.md
+++ b/problems/0084.柱状图中最大的矩形.md
@@ -725,62 +725,6 @@ impl Solution {
 }
 ```
 
-Rust
-
-双指针预处理
-```rust
-
-impl Solution {
-    pub fn largest_rectangle_area(v: Vec<i32>) -> i32 {
-        let n = v.len();
-        let mut left_smaller_idx = vec![-1; n];
-        let mut right_smaller_idx = vec![n as i32; n];
-        for i in 1..n {
-            let mut mid = i as i32 - 1;
-            while mid >= 0 && v[mid as usize] >= v[i] {
-                mid = left_smaller_idx[mid as usize];
-            }
-            left_smaller_idx[i] = mid;
-        }
-        for i in (0..n-1).rev() {
-            let mut mid = i + 1;
-            while mid < n && v[mid] >= v[i] {
-                mid = right_smaller_idx[mid] as usize;
-            }
-            right_smaller_idx[i] = mid as i32;
-        }
-        let mut res = 0;
-        for (idx, &e) in v.iter().enumerate() {
-            res = res.max((right_smaller_idx[idx] - left_smaller_idx[idx] - 1) * e);
-        }
-        dbg!(res)
-    }
-}
-```
-
-单调栈
-```rust
-impl Solution {
-    pub fn largest_rectangle_area1(mut v: Vec<i32>) -> i32 {
-        v.insert(0, 0);  // 便于使第一个元素能够有左侧<=它的值
-        v.push(0);                      // 便于在结束处理最后一个元素后清空残留在栈中的值
-        let mut res = 0;
-        let mut stack = vec![]; // 递增的栈
-        for (idx, &e) in v.iter().enumerate() {
-            while !stack.is_empty() && v[*stack.last().unwrap()] > e {
-                let pos = stack.pop().unwrap();
-                let prev_pos = *stack.last().unwrap();
-                let s = (idx - prev_pos - 1) as i32 * v[pos];
-                res = res.max(s);
-            }
-            stack.push(idx);
-        }
-        res
-    }  
-}
-```
-
-
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">
   <img src="../pics/网站星球宣传海报.jpg" width="1000"/>