263. Ugly Number

题目：

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.

思路：num是且都是（2,3,5）中的因数，所以可以每次除以其中的一个数字，如都不能被整除则return false

          当找到一个可被整除的数，那么继续利用它的商，递归下去。

public static boolean isUgly(int num) {
        // 是 且 都是
        // if 都不能被整除，则false
        // else 找出一个可被整除，其商也可以被（2，3,5）整除
        // 如发现,不能被整除 return false
        if (num <= 0) return false;
        int tmp = canDiv(num);
        if (tmp == 1) {
            return true;
        } else if (tmp == -1) {
            return false;
        } else {
            return isUgly(tmp);
        }
    }

    private static int canDiv(int num) {
        if (num % 2 == 0) return num / 2;
        else if (num % 3 == 0) return num / 3;
        else if (num % 5 == 0) return num / 5;
        else if (num == 1) return 1;
        else return -1;
    }

    // clean code
    public boolean isUglyBetter(int num) {
        if (num == 1) return true;
        if (num == 0) return false;
        while (num % 2 == 0)
            num = num / 2;
        while (num % 3 == 0)
            num = num / 3;
        while (num % 5 == 0)
            num = num / 5;
        return num == 1;
    }