剑指offer-3.26-49

暴力法：会超时

class Solution {
    public int nthUglyNumber(int n) {
        int[] mark = new int[n];
        int index = 0;
        for (int i = 1; ; i++) {
            int temp = i;
            while (temp != 1 && temp % 5 == 0) {
                temp /= 5;
            }
            while (temp != 1 && temp % 3 == 0) {
                temp /= 3;
            }
            while (temp != 1 && temp % 2 == 0) {
                temp /= 2;
            }
            if (temp == 1) {
                mark[index++] = i;
            } else {
            	continue;
            }
            if (index == n) {
                break;
            }
        }
        return mark[n - 1];
    }
}

动态规划：

class Solution {
    public int nthUglyNumber(int n) {
        int[] dp = new int[n];
        dp[0] = 1;
        int a = 0, b = 0, c = 0;
        for (int i = 1; i < n; i++) {
            int n2 = dp[a] * 2, n3 = dp[b] * 3, n5 = dp[c] * 5;
            dp[i] = Math.min(Math.min(n2, n3), n5);
            if (dp[i] == n2) {
                a++;
            }
            if (dp[i] == n3) {
                b++;
            }
            if (dp[i] == n5) {
                c++;
            }
        }
        return dp[n - 1];
    }
}