摘要： 1 //动态方程dp[i]=min(dp[p_2]*2,dp[p_3]*3,dp[p_5]*5) 2 class Solution 3 { 4 public: 5 int nthUglyNumber(int n) 6 { 7 vector<int> dp(n); 8 dp[0] = 1; 9 int 阅读全文

摘要： 1 class Solution 2 { 3 public: 4 bool isUgly(int num) 5 { 6 if (num == 0) return false; 7 while (num % 2 == 0) num /= 2; 8 while (num % 3 == 0) num /= 阅读全文