[leetcode] Ugly Number

最新推荐文章于 2024-06-04 11:57:06 发布

原创最新推荐文章于 2024-06-04 11:57:06 发布 · 580 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #numbers

算法专栏收录该内容

9 篇文章

订阅专栏

本文介绍了一种简单有效的算法来判断一个给定的整数是否为丑数。丑数是指仅包含质因数2、3和5的正整数。文章通过示例解释了丑数的概念，并提供了一个简洁的Java代码实现。

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.

题目很简单，直接上代码。

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