** Leetcode 264. Ugly Number II | dp

https://leetcode.com/problems/ugly-number-ii/description/

leetcode的题的代码总是能让人感觉原来可以写的这么简洁

参考了这里：https://leetcode.com/problems/ugly-number-ii/discuss/69364/My-16ms-C++-DP-solution-with-short-explanation

思路应该是容易想到的，就是怎么写的问题，

class Solution {
public:

    
    int nthUglyNumber(int n) {
        if (n <= 4) return n;
        int dp[n+1];
        int a2, a3, a5;
        a2 = a3 = a5 = 0;
        dp[0] = 1;
        // dp[1] = 1;
        for (int i = 1; i < n; i++) {
            dp[ i ] = min( dp[a2] * 2, min( dp[a3] * 3, dp[a5] * 5 ) );
            if (dp[i] == dp[a2] * 2) a2++;
            if (dp[i] == dp[a3] * 3) a3++;
            if (dp[i] == dp[a5] * 5) a5++;
        }
        return dp[n-1];
    }
};