leetcode刷题日记——Ugly Number

<span style="font-family: Arial, Helvetica, sans-serif; background-color: rgb(255, 255, 255);">Write a program to check whether a given number is an ugly number.</span>

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，因此解决办法就是消除n中所有的的2,3,5因子，最终看剥离了所有2,3,5因子之后的n是否是等于1,如果不等，说明n中还有其他因子，返回假，反之，返回真。实现代码如下：

class Solution {
public:
    bool isUgly(int num) {
        if(num==0) return false;
        int num1=num;
        while(num1%2==0){
            num1/=2;
        }
        while(num1%3==0){
            num1/=3;
        }
         while(num1%5==0){
            num1/=5;
        }
        if(num1==1)
          return true;
        return false;
    }
};