[LeetCode] 263. Ugly Number

 Problem : https://leetcode.com/problems/ugly-number/

Time Complexity = O ( Log N )

class Solution:
    def isUgly(self, num: int) -> bool:
        
        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

Use division to remove the prime factor 2, 3, 5 from the given number. Then check the remains of the number equals to 1