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.
recursively divide the number by 2,3,5 until finally reaches 1(true) or can't be divided by 2,3,5
1 public class Solution { 2 public static boolean isUgly(int num) { 3 if (num <= 0) { 4 return false; 5 } 6 7 int[] divisors = {2, 3, 5}; 8 9 for(int d : divisors) { 10 while (num % d == 0) { 11 num /= d; 12 } 13 } 14 return num == 1; 15 } 16 }