不去重錯(cuò)誤版 17.4.23

long isMin (long a, long b) {
if (a >= b)
a = b;
return a;
}
long nthUglyNumber(long n) {
long *l = (long*)malloc(n*sizeof(long));
for (long i = 0; i < n; i++)
l[i] = 0;
l[0] = 1;
long p2, p3, p5 = 0;
for(long i = 0; i < n - 1; i++) {
l[i + 1] = isMin(l[p2] * 2,isMin(l[p3] * 3,l[p5] * 5));
if(l[i + 1] == l[p2]*2)
p2++;
if(l[i + 1] == l[p3]*3)
p3++;
if(l[i + 1] == l[p5]*5)
p5++;
}
return l[n - 1];
}

________________________________________________________________________________

17.4.24

java版 AC

public class Solution {
public int nthUglyNumber(int n) {
int[] num = new int[n];
num[0] = 1;
int p2 = 0, p3 = 0, p5 = 0;
for (int i = 1; i < n; i++) {
int min = Math.min(num[p2]*2,Math.min(num[p3]*3, num[p5]*5));
num[i] = min;
if(min == num[p2]*2) p2++;
if(min == num[p3]*3) p3++;
if(min == num[p5]*5) p5++;
}
return num[n - 1];
}
}

轉(zhuǎn)載于:https://www.cnblogs.com/bloomingFlower/p/6753799.html

總結(jié)

以上是生活随笔為你收集整理的UGLY NUMBERS II的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。