feat: add rust solution to lcof problem: No.49

面试题49. 丑数

Author: YangFong

lcof/面试题49. 丑数/README.md

@@ -111,19 +111,18 @@ public:
  * @return {number}
  */
 var nthUglyNumber = function (n) {
-    let dp = [1];
+    const dp = [1];
     let p2 = 0,
         p3 = 0,
         p5 = 0;
     for (let i = 1; i < n; ++i) {
         const next2 = dp[p2] * 2,
             next3 = dp[p3] * 3,
             next5 = dp[p5] * 5;
-        dp[i] = Math.min(next2, Math.min(next3, next5));
+        dp[i] = Math.min(next2, next3, next5);
         if (dp[i] == next2) ++p2;
         if (dp[i] == next3) ++p3;
         if (dp[i] == next5) ++p5;
-        dp.push(dp[i]);
     }
     return dp[n - 1];
 };
@@ -160,6 +159,37 @@ func min(a, b int) int {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn nth_ugly_number(n: i32) -> i32 {
+        let n = n as usize;
+        let mut dp = vec![1; n];
+        let mut p2 = 0;
+        let mut p3 = 0;
+        let mut p5 = 0;
+        for i in 1..n {
+            let n2 = dp[p2] * 2;
+            let n3 = dp[p3] * 3;
+            let n5 = dp[p5] * 5;
+            dp[i] = n2.min(n3.min(n5));
+
+            if dp[i] == n2 {
+                p2 += 1;
+            };
+            if dp[i] == n3 {
+                p3 += 1;
+            };
+            if dp[i] == n5 {
+                p5 += 1;
+            };
+        }
+        dp[n - 1]
+    }
+}
+```
+
 ### **...**
 
 ```

lcof/面试题49. 丑数/Solution.js

@@ -3,19 +3,18 @@
  * @return {number}
  */
 var nthUglyNumber = function (n) {
-    let dp = [1];
+    const dp = [1];
     let p2 = 0,
         p3 = 0,
         p5 = 0;
     for (let i = 1; i < n; ++i) {
         const next2 = dp[p2] * 2,
             next3 = dp[p3] * 3,
             next5 = dp[p5] * 5;
-        dp[i] = Math.min(next2, Math.min(next3, next5));
+        dp[i] = Math.min(next2, next3, next5);
         if (dp[i] == next2) ++p2;
         if (dp[i] == next3) ++p3;
         if (dp[i] == next5) ++p5;
-        dp.push(dp[i]);
     }
     return dp[n - 1];
 };

lcof/面试题49. 丑数/Solution.rs

@@ -0,0 +1,26 @@
+impl Solution {
+    pub fn nth_ugly_number(n: i32) -> i32 {
+        let n = n as usize;
+        let mut dp = vec![1; n];
+        let mut p2 = 0;
+        let mut p3 = 0;
+        let mut p5 = 0;
+        for i in 1..n {
+            let n2 = dp[p2] * 2;
+            let n3 = dp[p3] * 3;
+            let n5 = dp[p5] * 5;
+            dp[i] = n2.min(n3.min(n5));
+
+            if dp[i] == n2 {
+                p2 += 1;
+            };
+            if dp[i] == n3 {
+                p3 += 1;
+            };
+            if dp[i] == n5 {
+                p5 += 1;
+            };
+        }
+        dp[n - 1]
+    }
+}