[Leetcode 263] Ugly Number

最新推荐文章于 2022-11-18 10:09:03 发布

Mavs

最新推荐文章于 2022-11-18 10:09:03 发布

阅读量1.2k

点赞数

分类专栏： Leetcode Java LeetCode Questions 文章标签： leetcode math

本文链接：https://blog.csdn.net/sbitswc/article/details/48168105

版权

Leetcode 同时被 3 个专栏收录

287 篇文章

订阅专栏

LeetCode Questions

178 篇文章

订阅专栏

Java

106 篇文章

订阅专栏

本文提供了一个Java程序，用于检查给定的整数是否为丑数。丑数定义为只包含质因数2、3、5的正整数，其中1通常被视为丑数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

solution: according to defination, only be divided by 2,3,5

public boolean isUgly(int num) {
        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;
    }