#include <stdio.h>
#include <stdbool.h>
#include <math.h>
int nthUglyNumber(int n) {
int dp[n + 1];
dp[1] = 1;
int p2 = 1, p3 = 1, p5 = 1;
for (int i = 2; i <= n; i++) {
int num2 = dp[p2] * 2, num3 = dp[p3] * 3, num5 = dp[p5] * 5;
dp[i] = fmin(fmin(num2, num3), num5);
if (dp[i] == num2) {
p2++;
}
if (dp[i] == num3) {
p3++;
}
if (dp[i] == num5) {
p5++;
}
}
printf("%d",dp[n]);
return dp[n];
}
int main() {
nthUglyNumber(10);
return 0;
}
264 丑数 动态规划
最新推荐文章于 2024-08-19 11:12:00 发布