feat: add rust solution to lcof problems: No.14 - |,14 - ||

- 面试题14- I. 剪绳子
- 面试题14- II. 剪绳子 II

Author: YangFong

lcof/面试题14- I. 剪绳子/README.md

@@ -135,6 +135,24 @@ public:
 };
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn cutting_rope(mut n: i32) -> i32 {
+        if n < 4 {
+            return n - 1;
+        }
+        let mut res = 1;
+        while n > 4 {
+            res *= 3;
+            n -= 3;
+        }
+        res * n
+    }
+}
+```
+
 ### **...**
 
 ```

lcof/面试题14- I. 剪绳子/Solution.rs

@@ -0,0 +1,13 @@
+impl Solution {
+    pub fn cutting_rope(mut n: i32) -> i32 {
+        if n < 4 {
+            return n - 1;
+        }
+        let mut res = 1;
+        while n > 4 {
+            res *= 3;
+            n -= 3;
+        }
+        res * n
+    }
+}

lcof/面试题14- II. 剪绳子 II/README.md

@@ -131,13 +131,29 @@ public:
             ans = ans * 3 % mod;
             n -= 3;
         }
-        if (n == 4)
-            return ans * 4 % mod;
         return ans * n % mod;
     }
 };
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn cutting_rope(mut n: i32) -> i32 {
+        if n < 4 {
+            return n - 1;
+        }
+        let mut res = 1i64;
+        while n > 4 {
+            res = (res * 3) % 1000000007;
+            n -= 3;
+        }
+        ((res * n as i64) % 1000000007) as i32
+    }
+}
+```
+
 ### **...**
 
 ```

lcof/面试题14- II. 剪绳子 II/Solution.cpp

@@ -8,8 +8,6 @@ class Solution {
             ans = ans * 3 % mod;
             n -= 3;
         }
-        if (n == 4)
-            return ans * 4 % mod;
         return ans * n % mod;
     }
 };

lcof/面试题14- II. 剪绳子 II/Solution.rs

@@ -0,0 +1,13 @@
+impl Solution {
+    pub fn cutting_rope(mut n: i32) -> i32 {
+        if n < 4 {
+            return n - 1;
+        }
+        let mut res = 1i64;
+        while n > 4 {
+            res = (res * 3) % 1000000007;
+            n -= 3;
+        }
+        ((res * n as i64) % 1000000007) as i32
+    }
+}