LeetCode 263. Ugly Number

最新推荐文章于 2023-12-15 20:03:18 发布

原创最新推荐文章于 2023-12-15 20:03:18 发布 · 159 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 题解专栏收录该内容

288 篇文章

订阅专栏

本文介绍了一种用于检查给定整数是否为丑数的递归算法。丑数定义为只包含质因数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.

Do it recursively.

    bool isUgly(int num) {
        if(num < 1) return false;
        if(num == 1) return true;
        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;
    }