国电结束了,终于又有时间来刷题了,不过,这么多天不刷,有点不想再刷了的感觉。
今天来一道简单的,寻找丑数。
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.
也就是说丑数的因子只能含有2,3,5中的一个或者多个,不能有其他数。
打算用递归来实现
class Solution {
public:
bool isUgly(int num) {
if(num == 0) return false;
if(num % 2 == 0)
{
num /= 2;
num = isUgly(num);
}
else if(num % 3 == 0)
{
num /= 3;
num = isUgly(num);
}
else if(num % 5 == 0)
{
num /= 5;
num = isUgly(num);
}
if(num == 1) return true;
else return false;
}
};
不过感觉这里用递归不是很好。
在网上找了一下,发现大多数是这样实现的
bool IsUgly(int number)
{
while(number % 2 == 0)
number /= 2;
while(number % 3 == 0)
number /= 3;
while(number % 5 == 0)
number /= 5;
if(number == 1)
return true;
else
return false;
}