leetcode 263. Ugly number

Title Description ：

Give you an integer n , Please judge n Is it Ugly number . If it is , return true ; otherwise , return false .

Ugly number That is, only the prime factor is included 2、3 and / or 5 The positive integer .

Examples ：

Example 1：

Input ：n = 6
Output ：true
explain ：6 = 2 × 3

Example 2：

Input ：n = 8
Output ：true
explain ：8 = 2 × 2 × 2

Example 3：

Input ：n = 14
Output ：false
explain ：14 It's not ugly , Because it contains another prime factor 7 .

Example 4：

Input ：n = 1
Output ：true
explain ：1 It's usually considered ugly .

Tips ：

• -2^31 <= n <= 2^31 - 1

Java Program ：

class Solution {
    public boolean isUgly(int n) {
        if (n <= 0) {
            return false;
        }
        int[] factors = {2, 3, 5};
        for (int factor : factors) {
            while (n % factor == 0) {
                n /= factor;
            }
        }
        return n == 1;
    }
}