Leetcode 264. Ugly Number II | | Leetcode 264. Ugly Number II 文章作者:Tyan博客:noahsnail.com | CSDN | 简书 1. Description 2. Solution1234567891011121314151617181920212223242526class Solution {public: int nthUglyNumber(int n) { if(n == 1) { return 1; } int ugly[n] = {0}; ugly[0] = 1; int two = 0; int three = 0; int five = 0; for(int i = 1; i < n; i++) { ugly[i] = min(min(ugly[two] * 2, ugly[three] * 3), ugly[five] * 5); if(ugly[i] == ugly[two] * 2) { two++; } if(ugly[i] == ugly[three] * 3) { three++; } if(ugly[i] == ugly[five] * 5) { five++; } } return ugly[n - 1]; }}; Reference https://leetcode.com/problems/ugly-number-ii/description/ 如果有收获,可以请我喝杯咖啡! 赏 微信打赏 支付宝打赏