feat: update leetcode solutions: No.0264. Ugly Number II

Author: yanglbme

index.html

@@ -45,9 +45,9 @@
         codeFontFamily: 'Roboto Mono, Monaco, courier, monospace',
         bodyFontSize: '15px',
         dark: {
-          background: 'rgb(28,32,34)',
+          background: '#191919',
           highlightColor: '#e96900',
-          codeBackgroundColor: 'rgb(34,39,46)',
+          codeBackgroundColor: '#202020',
           codeTextColor: '#b4b4b4',
         },
         light: {

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

@@ -127,6 +127,37 @@ var nthUglyNumber = function (n) {
 };
 ```
 
+### **Go**
+
+```go
+func nthUglyNumber(n int) int {
+    dp := make([]int, n)
+    dp[0] = 1
+    p2, p3, p5 := 0, 0, 0
+    for i := 1; i < n; i++ {
+        next2, next3, next5 := dp[p2]*2, dp[p3]*3, dp[p5]*5
+        dp[i] = min(next2, min(next3, next5))
+        if dp[i] == next2 {
+            p2++
+        }
+        if dp[i] == next3 {
+            p3++
+        }
+        if dp[i] == next5 {
+            p5++
+        }
+    }
+    return dp[n-1]
+}
+
+func min(a, b int) int {
+    if a < b {
+        return a
+    }
+    return b
+}
+```
+
 ### **...**
 
 ```

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

@@ -0,0 +1,26 @@
+func nthUglyNumber(n int) int {
+    dp := make([]int, n)
+    dp[0] = 1
+    p2, p3, p5 := 0, 0, 0
+    for i := 1; i < n; i++ {
+        next2, next3, next5 := dp[p2]*2, dp[p3]*3, dp[p5]*5
+        dp[i] = min(next2, min(next3, next5))
+        if dp[i] == next2 {
+            p2++
+        }
+        if dp[i] == next3 {
+            p3++
+        }
+        if dp[i] == next5 {
+            p5++
+        }
+    }
+    return dp[n-1]
+}
+
+func min(a, b int) int {
+    if a < b {
+        return a
+    }
+    return b
+}

solution/0200-0299/0264.Ugly Number II/README.md

@@ -22,7 +22,7 @@
 	<li><code>n</code>&nbsp;<strong>不超过</strong>1690。</li>
 </ol>
 
-同 [面试题 49. 丑数](/lcof/面试题49.%20丑数/README.md)
+同[面试题 49. 丑数](/lcof/面试题49.%20丑数/README.md)。
 
 ## 解法
 
@@ -130,6 +130,37 @@ var nthUglyNumber = function (n) {
 };
 ```
 
+### **Go**
+
+```go
+func nthUglyNumber(n int) int {
+    dp := make([]int, n)
+    dp[0] = 1
+    p2, p3, p5 := 0, 0, 0
+    for i := 1; i < n; i++ {
+        next2, next3, next5 := dp[p2]*2, dp[p3]*3, dp[p5]*5
+        dp[i] = min(next2, min(next3, next5))
+        if dp[i] == next2 {
+            p2++
+        }
+        if dp[i] == next3 {
+            p3++
+        }
+        if dp[i] == next5 {
+            p5++
+        }
+    }
+    return dp[n-1]
+}
+
+func min(a, b int) int {
+    if a < b {
+        return a
+    }
+    return b
+}
+```
+
 ### **...**
 
 ```

solution/0200-0299/0264.Ugly Number II/README_EN.md

@@ -115,6 +115,37 @@ var nthUglyNumber = function (n) {
 };
 ```
 
+### **Go**
+
+```go
+func nthUglyNumber(n int) int {
+    dp := make([]int, n)
+    dp[0] = 1
+    p2, p3, p5 := 0, 0, 0
+    for i := 1; i < n; i++ {
+        next2, next3, next5 := dp[p2]*2, dp[p3]*3, dp[p5]*5
+        dp[i] = min(next2, min(next3, next5))
+        if dp[i] == next2 {
+            p2++
+        }
+        if dp[i] == next3 {
+            p3++
+        }
+        if dp[i] == next5 {
+            p5++
+        }
+    }
+    return dp[n-1]
+}
+
+func min(a, b int) int {
+    if a < b {
+        return a
+    }
+    return b
+}
+```
+
 ### **...**
 
 ```

solution/0200-0299/0264.Ugly Number II/Solution.go

@@ -0,0 +1,26 @@
+func nthUglyNumber(n int) int {
+    dp := make([]int, n)
+    dp[0] = 1
+    p2, p3, p5 := 0, 0, 0
+    for i := 1; i < n; i++ {
+        next2, next3, next5 := dp[p2]*2, dp[p3]*3, dp[p5]*5
+        dp[i] = min(next2, min(next3, next5))
+        if dp[i] == next2 {
+            p2++
+        }
+        if dp[i] == next3 {
+            p3++
+        }
+        if dp[i] == next5 {
+            p5++
+        }
+    }
+    return dp[n-1]
+}
+
+func min(a, b int) int {
+    if a < b {
+        return a
+    }
+    return b
+}