From 1c7b15bbbc224e37f9341161f31a94cebe73dfb0 Mon Sep 17 00:00:00 2001
From: Zhipeng Xu <zhipengxu@sjtu.edu.cn>
Date: Sat, 8 Jul 2023 18:26:09 +0800
Subject: [PATCH] =?UTF-8?q?Update=200496.=E4=B8=8B=E4=B8=80=E4=B8=AA?=
 =?UTF-8?q?=E6=9B=B4=E5=A4=A7=E5=85=83=E7=B4=A0I.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0496.下一个更大元素I.md | 26 +++++++++++++++++++++++++
 1 file changed, 26 insertions(+)

diff --git a/problems/0496.下一个更大元素I.md b/problems/0496.下一个更大元素I.md
index 31c3ce43..411a47df 100644
--- a/problems/0496.下一个更大元素I.md
+++ b/problems/0496.下一个更大元素I.md
@@ -387,6 +387,32 @@ function nextGreaterElement(nums1: number[], nums2: number[]): number[] {
 };
 ```
 
+Rust
+
+```rust
+impl Solution {
+    pub fn next_greater_element(nums1: Vec<i32>, nums2: Vec<i32>) -> Vec<i32> {
+        let mut ans = vec![-1; nums1.len()];
+        use std::collections::HashMap;
+        let mut map = HashMap::new();
+        for (idx, &i) in nums1.iter().enumerate() {
+            map.insert(i, idx);
+        }
+        let mut stack = vec![];
+        for (idx, &i) in nums2.iter().enumerate() {
+            while !stack.is_empty() && nums2[*stack.last().unwrap()] < i {
+                let pos = stack.pop().unwrap();
+                if let Some(&jdx) = map.get(&nums2[pos]) {
+                    ans[jdx] = i;
+                }
+            }
+            stack.push(idx);
+        }
+        ans
+    }
+}
+```
+
 
 
 <p align="center">