Write a program to find the n-th ugly number.
Ugly numbers are positive numbers whose prime factors only include 2, 3, 5.
Example:
Input: n = 10
Output: 12
Explanation: 1, 2, 3, 4, 5, 6, 8, 9, 10, 12 is the sequence of the first 10 ugly numbers.
Note:
1 is typically treated as an ugly number.
n does not exceed 1690.
func nthUglyNumber(n int) int {
res := []int{1}
id2, id3, id5 := 0, 0, 0
for len(res) < n {
v := min(res[id2]*2, min(res[id3]*3, res[id5]*5))
if v == res[id2]*2 {
id2++
}
if v == res[id3]*3 {
id3++
}
if v == res[id5]*5 {
id5++
}
res = append(res, v)
}
return res[len(res)-1]
}
func min(i, j int) int {
if i < j {
return i
}
return j
}