diff --git a/solution/2100-2199/2141.Maximum Running Time of N Computers/README.md b/solution/2100-2199/2141.Maximum Running Time of N Computers/README.md
index dea0a3d05ea33..6643c36de2d43 100644
--- a/solution/2100-2199/2141.Maximum Running Time of N Computers/README.md	
+++ b/solution/2100-2199/2141.Maximum Running Time of N Computers/README.md	
@@ -58,6 +58,59 @@
 
 <!-- tabs:start -->
 
+### **Rust**
+
+```rust
+impl Solution {
+    #[allow(dead_code)]
+    pub fn max_run_time(n: i32, batteries: Vec<i32>) -> i64 {
+
+        // First sort the batteries 
+        let mut batteries = batteries;
+        let m = batteries.len() as i32;
+        batteries.sort();
+
+        let mut extra_sum: i64 = 0;
+        for i in 0..(m - n) as usize {
+            extra_sum += batteries[i] as i64;
+        }
+
+        let mut i = (m - n) as usize;
+        let mut cur_height = batteries[i];
+        let mut ret = cur_height as i64;
+        while extra_sum != 0 {
+            if i + 1 == m as usize {
+                assert!(cur_height == *batteries.last().unwrap());
+                ret += extra_sum / n as i64;
+                break;
+            }
+
+            if batteries[i] == batteries[i + 1] {
+                i += 1;
+                continue;
+            }
+
+            let diff = extra_sum / (i - (m - n) as usize + 1) as i64;
+
+            if (cur_height as i64 + diff) <= batteries[i + 1] as i64 {
+                ret = cur_height as i64 + diff;
+                break;
+            } else {
+                extra_sum -= (batteries[i + 1] - batteries[i]) as i64 * (i - (m - n) as usize + 1) as i64;
+                ret = batteries[i + 1] as i64;
+            }
+
+            i += 1;
+            if i != m as usize {
+                cur_height = batteries[i];
+            }
+        }
+
+        ret
+    }
+}
+```
+
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
diff --git a/solution/2100-2199/2141.Maximum Running Time of N Computers/README_EN.md b/solution/2100-2199/2141.Maximum Running Time of N Computers/README_EN.md
index 677b685227a9b..348727928eb64 100644
--- a/solution/2100-2199/2141.Maximum Running Time of N Computers/README_EN.md	
+++ b/solution/2100-2199/2141.Maximum Running Time of N Computers/README_EN.md	
@@ -51,6 +51,59 @@ We can run the two computers simultaneously for at most 2 minutes, so we return
 
 <!-- tabs:start -->
 
+### **Rust**
+
+```rust
+impl Solution {
+    #[allow(dead_code)]
+    pub fn max_run_time(n: i32, batteries: Vec<i32>) -> i64 {
+
+        // First sort the batteries 
+        let mut batteries = batteries;
+        let m = batteries.len() as i32;
+        batteries.sort();
+
+        let mut extra_sum: i64 = 0;
+        for i in 0..(m - n) as usize {
+            extra_sum += batteries[i] as i64;
+        }
+
+        let mut i = (m - n) as usize;
+        let mut cur_height = batteries[i];
+        let mut ret = cur_height as i64;
+        while extra_sum != 0 {
+            if i + 1 == m as usize {
+                assert!(cur_height == *batteries.last().unwrap());
+                ret += extra_sum / n as i64;
+                break;
+            }
+
+            if batteries[i] == batteries[i + 1] {
+                i += 1;
+                continue;
+            }
+
+            let diff = extra_sum / (i - (m - n) as usize + 1) as i64;
+
+            if (cur_height as i64 + diff) <= batteries[i + 1] as i64 {
+                ret = cur_height as i64 + diff;
+                break;
+            } else {
+                extra_sum -= (batteries[i + 1] - batteries[i]) as i64 * (i - (m - n) as usize + 1) as i64;
+                ret = batteries[i + 1] as i64;
+            }
+
+            i += 1;
+            if i != m as usize {
+                cur_height = batteries[i];
+            }
+        }
+
+        ret
+    }
+}
+```
+
 ### **Python3**
 
 ```python
diff --git a/solution/2100-2199/2141.Maximum Running Time of N Computers/Solution.rs b/solution/2100-2199/2141.Maximum Running Time of N Computers/Solution.rs
new file mode 100644
index 0000000000000..0155d1c1c83f4
--- /dev/null
+++ b/solution/2100-2199/2141.Maximum Running Time of N Computers/Solution.rs	
@@ -0,0 +1,48 @@
+impl Solution {
+    #[allow(dead_code)]
+    pub fn max_run_time(n: i32, batteries: Vec<i32>) -> i64 {
+
+        // First sort the batteries 
+        let mut batteries = batteries;
+        let m = batteries.len() as i32;
+        batteries.sort();
+
+        let mut extra_sum: i64 = 0;
+        for i in 0..(m - n) as usize {
+            extra_sum += batteries[i] as i64;
+        }
+
+        let mut i = (m - n) as usize;
+        let mut cur_height = batteries[i];
+        let mut ret = cur_height as i64;
+        while extra_sum != 0 {
+            if i + 1 == m as usize {
+                assert!(cur_height == *batteries.last().unwrap());
+                ret += extra_sum / n as i64;
+                break;
+            }
+
+            if batteries[i] == batteries[i + 1] {
+                i += 1;
+                continue;
+            }
+
+            let diff = extra_sum / (i - (m - n) as usize + 1) as i64;
+
+            if (cur_height as i64 + diff) <= batteries[i + 1] as i64 {
+                ret = cur_height as i64 + diff;
+                break;
+            } else {
+                extra_sum -= (batteries[i + 1] - batteries[i]) as i64 * (i - (m - n) as usize + 1) as i64;
+                ret = batteries[i + 1] as i64;
+            }
+
+            i += 1;
+            if i != m as usize {
+                cur_height = batteries[i];
+            }
+        }
+
+        ret
+    }
+}
\ No newline at end of file