264. 丑数 II——动态规划

class Solution {
public:
    int nthUglyNumber(int n) {
        vector<int> dp(n + 1);
        int num1 = 1, num2 = 1, num3 = 1;
        dp[1] = 1;
        for(int i = 2; i <= n; ++i){
            //不断地更新，从中取小
            int temp1 = dp[num1] * 2, temp2 = dp[num2] * 3, temp3 = dp[num3] * 5;
            dp[i] = min(temp1, min(temp2, temp3));
            //不能if else,因为存在2 * 3 == 3 * 2的情况，会出现2次6
            if(dp[i] == temp1)
                num1++;
            if(dp[i] == temp2)
                num2++;
            if(dp[i] == temp3)
                num3++;
        }
        return dp[n];
    }
};

Accepted
596/596 cases passed (4 ms)
Your runtime beats 92.2 % of cpp submissions
Your memory usage beats 83.15 % of cpp submissions (7.4 MB)