[LeetCode] 263. Ugly Number

最新推荐文章于 2025-11-24 14:38:27 发布

原创最新推荐文章于 2025-11-24 14:38:27 发布 · 197 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#java #leetcode

leetcode 专栏收录该内容

14 篇文章

订阅专栏

本文介绍了一种检查给定数字是否为丑数的算法。丑数定义为仅包含2、3、5作为质因数的正整数。通过实例演示了如何使用此算法判断6、8和14是否为丑数。

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

public boolean isUgly(int num) {
        if(num<=0){
            return false;
        }
        while(true){
            if(num==1){
                return true;
            }else if(num%5==0){
                num=num/5;
            }else if(num%3==0){
                num/=3;
            }else if(num%2==0){
                num/=2;
            }else{
                return false;
            }
        }
    }