LeetCode - Ugly Number

最新推荐文章于 2022-03-01 10:09:02 发布

原创最新推荐文章于 2022-03-01 10:09:02 发布 · 392 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

算法同时被 3 个专栏收录

27 篇文章

订阅专栏

C++

19 篇文章

订阅专栏

PAT/LeetCode/hihoCoder

16 篇文章

订阅专栏

本文介绍了一种使用C++编程语言来判断一个给定的正整数是否为丑数的方法。丑数定义为仅包含质因数2、3和5的正整数。通过不断去除给定数字中2、3和5的因子，最终判断剩余部分是否为1来确定该数字是否为丑数。

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

Question

Link :

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 that1is typically treated as an ugly number.

Code

这是一个比较挫的版本。。。（C++ ：8ms）

class Solution {
public:
    bool isUgly(int num) {
        if (num <= 0) return false;
        else if(num == 1) return true;
        int sub1, sub2, sub3;
        do{
            sub1 = num % 2;
            if(sub1 == 0){ num /= 2; continue;}

            sub2 = num % 3;
            if(sub2 == 0) {num /= 3; continue;}

            sub3 = num % 5;
            if(sub3 == 0) {num /= 5; continue;}
        }while(sub1 == 0 || sub2 == 0 || sub3 == 0);
        return num == 1;
    }
};