Write a program to check whether a given number is an ugly number.
Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 are ugly while 14 is not ugly since it includes another prime factor 7.
Note that 1 is typically treated as an ugly number.
Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.
Subscribe to see which companies asked this question
思路分析:只包括质因数2,3,5的正整数是丑数。如果一个数能连续被2整除,或连续被3整除,或连续被5整除,最后的数为1 即为丑数。
class Solution {
public:
bool isUgly(int num) {
if( num <= 0 ) return false;
while( num % 2 == 0 ) num /= 2;
while( num % 3 == 0 ) num /= 3;
while( num % 5 == 0 ) num /= 5;
return ( num == 1 ) ? true : false;
}
};
本文介绍了一种用于判断一个给定的正整数是否为丑数的算法。丑数是指仅包含质因数2、3和5的正整数。文章提供了具体的代码实现,并解释了如何通过连续除以2、3、5来简化问题。
553

被折叠的 条评论
为什么被折叠?



