刷一题Leetcode:Ugly Number

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

原创最新推荐文章于 2022-11-18 10:09:03 发布 · 526 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #Math

编程日记专栏收录该内容

68 篇文章

订阅专栏

本文提供了一个Java程序，用于检查给定的整数是否为丑数。丑数定义为只包含质因数2、3或5的正整数。程序通过递归地除以这些质因数来判断输入数是否为丑数。

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.

Credits:

Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

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