Ugly Number--leetcode

最新推荐文章于 2017-06-14 21:10:02 发布

原创最新推荐文章于 2017-06-14 21:10:02 发布 · 533 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#uglynumber

Leedcode 专栏收录该内容

57 篇文章

订阅专栏

本文介绍了一种使用递归方法检查给定数字是否为丑数的算法。丑数是指仅包含2、3、5作为质因数的正整数。文章提供了C++实现的示例代码。

摘要生成于 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.
判断一个数的因子是不是只有2或者3或者5。使用递归的思想。

c++:

class Solution {
public:
    bool isUgly(int num) {
        if (num == 1) return true;
        if (num == 0) return false;

        else if (num % 2 == 0) return isUgly(num / 2);
        else if (num % 3 == 0) return isUgly(num / 3);
        else if (num % 5 == 0) return isUgly(num / 5);

        else return false; 

    }
};