From e43323b1e1f3556dc7bc38b4ae6bdd13508e0aea Mon Sep 17 00:00:00 2001
From: "junjie2.luo" <junjie2.luo@rootcloud.com>
Date: Thu, 10 Oct 2024 17:18:41 +0800
Subject: [PATCH] =?UTF-8?q?feat:=201365.=E6=9C=89=E5=A4=9A=E5=B0=91?=
 =?UTF-8?q?=E5=B0=8F=E4=BA=8E=E5=BD=93=E5=89=8D=E6=95=B0=E5=AD=97=E7=9A=84?=
 =?UTF-8?q?=E6=95=B0=E5=AD=97,=E6=96=B0=E5=A2=9Erust=E8=A7=A3=E6=B3=95?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../1365.有多少小于当前数字的数字.md | 16 ++++++++++++++++
 1 file changed, 16 insertions(+)

diff --git a/problems/1365.有多少小于当前数字的数字.md b/problems/1365.有多少小于当前数字的数字.md
index 94c1eb77..64f61096 100644
--- a/problems/1365.有多少小于当前数字的数字.md
+++ b/problems/1365.有多少小于当前数字的数字.md
@@ -260,6 +260,22 @@ function smallerNumbersThanCurrent(nums: number[]): number[] {
 };
 ```
 
+### rust
+```rust
+use std::collections::HashMap;
+impl Solution {
+    pub fn smaller_numbers_than_current(nums: Vec<i32>) -> Vec<i32> {
+        let mut v = nums.clone();
+        v.sort();
+        let mut hash = HashMap::new();
+        for i in 0..v.len() {
+            // rust中使用or_insert插入值, 如果存在就不插入,可以使用正序遍历
+            hash.entry(v[i]).or_insert(i as i32);
+        }
+        nums.into_iter().map(|x| *hash.get(&x).unwrap()).collect()
+    }
+}
+```
 
 
 <p align="center">