263. Ugly Number

JIAKAOBO

LeetCode

感谢赞助!

• ㊗️
• 大家
• offer
• 多多！

Problem

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.

Example 1:

Input: 6
Output: true
Explanation: 6 = 2 × 3

Example 2:

Input: 8
Output: true
Explanation: 8 = 2 × 2 × 2

Example 3:

Input: 14
Output: false
Explanation: 14 is not ugly since it includes another prime factor 7.

Code

class Solution {
    public boolean isUgly(int n) {
        if(n < 1){
            return false;
        }

        while (n % 2 == 0){
             n /= 2;
        }
          
        while (n % 3 == 0){
             n /= 3;
        }
        
        while (n % 5 == 0){
             n /= 5;
        }

        return n == 1;
    }
}

class Solution:
    def isUgly(self, num: int) -> bool:
        if num < 1:
            return False

        while num % 2 == 0:
            num //= 2

        while num % 3 == 0:
            num //= 3

        while num % 5 == 0:
            num //= 5

        return num == 1