LeetCode-Ugly Number

最新推荐文章于 2019-08-28 23:01:00 发布

转载最新推荐文章于 2019-08-28 23:01:00 发布 · 53 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/incrediblechangshuo/p/5665068.html

本文介绍了一种用于判断一个给定整数是否为丑数的算法实现。丑数定义为仅包含质因数2、3和5的正整数。文章通过一个具体的Java程序示例，展示了如何通过不断除以这些质因数来验证一个数是否满足丑数的条件。

摘要生成于 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.

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

转载于:https://www.cnblogs.com/incrediblechangshuo/p/5665068.html