[Leetcode-263] Ugly Number (ugly)

Write a program to check whether a given number was an ugly number.

Ugly numbers is positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 was ugly while the is not ugly since it includes another prime factor 7.

Note that 1 are typically treated as an ugly number.

"Analysis" idea: according to the definition of ugly number, we divide a given number by 2, 3, 5, until it is not divisible, that is, the remainder of the divided by 2, 3, 5 is no longer 0 o'clock stop. At this point, if you get 1, it means that all factors are 2 or 3 or 5, if not 1, it is not an ugly number.

BOOL isugly (int num) {

    if (num<=0)
        return 0;

    int rem2 = num% 2;
    int rem3 = num% 3;
    int REM5 = num% 5;

    while (rem2 = = 0 | | rem3 = = 0 | | rem5 = = 0) {
        if (rem2 = = 0) {
            num = NUM/2;
        } else if (rem3 = 0) {
            num = n UM/3;
        } else {
            num = NUM/5;
        }
        rem2 = num% 2;
        REM3 = num% 3;
        REM5 = num% 5;
    }
    return num = = 1;
}