feat: add rust solution to lc problem: No.2366 (#1547)

Author: xzhseh

solution/2300-2399/2366.Minimum Replacements to Sort the Array/README.md

@@ -130,6 +130,37 @@ public:
 };
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    #[allow(dead_code)]
+    pub fn minimum_replacement(nums: Vec<i32>) -> i64 {
+        if nums.len() == 1 {
+            return 0;
+        }
+
+        let n = nums.len();
+        let mut max = *nums.last().unwrap();
+        let mut ret = 0;
+
+        for i in (0..=n - 2).rev() {
+            if nums[i] <= max {
+                max = nums[i];
+                continue;
+            }
+            // Otherwise make the substitution
+            let k = (nums[i] + max - 1) / max;
+            ret += (k - 1) as i64;
+            // Update the max value, which should be the minimum among the substitution
+            max = nums[i] / k;
+        }
+
+        ret
+    }
+}
+```
+
 ### **Go**
 
 ```go

solution/2300-2399/2366.Minimum Replacements to Sort the Array/README_EN.md

@@ -108,6 +108,37 @@ public:
 };
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    #[allow(dead_code)]
+    pub fn minimum_replacement(nums: Vec<i32>) -> i64 {
+        if nums.len() == 1 {
+            return 0;
+        }
+
+        let n = nums.len();
+        let mut max = *nums.last().unwrap();
+        let mut ret = 0;
+
+        for i in (0..=n - 2).rev() {
+            if nums[i] <= max {
+                max = nums[i];
+                continue;
+            }
+            // Otherwise make the substitution
+            let k = (nums[i] + max - 1) / max;
+            ret += (k - 1) as i64;
+            // Update the max value, which should be the minimum among the substitution
+            max = nums[i] / k;
+        }
+
+        ret
+    }
+}
+```
+
 ### **Go**
 
 ```go

solution/2300-2399/2366.Minimum Replacements to Sort the Array/Solution.rs

@@ -0,0 +1,26 @@
+impl Solution {
+    #[allow(dead_code)]
+    pub fn minimum_replacement(nums: Vec<i32>) -> i64 {
+        if nums.len() == 1 {
+            return 0;
+        }
+
+        let n = nums.len();
+        let mut max = *nums.last().unwrap();
+        let mut ret = 0;
+
+        for i in (0..=n - 2).rev() {
+            if nums[i] <= max {
+                max = nums[i];
+                continue;
+            }
+            // Otherwise make the substitution
+            let k = (nums[i] + max - 1) / max;
+            ret += (k - 1) as i64;
+            // Update the max value, which should be the minimum among the substitution
+            max = nums[i] / k;
+        }
+
+        ret
+    }
+}