LeetCode: 263. Ugly Number

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

杨领well

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

阅读量144

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/yanglingwell/article/details/88523168

LeetCode 专栏收录该内容

250 篇文章

订阅专栏

本文介绍LeetCode第263题“丑数”的解题思路与代码实现。丑数定义为仅包含质因数2、3和5的正整数。文章详细解释了如何通过递归算法判断一个数是否为丑数，并提供了C++实现的AC代码。

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

LeetCode: 263. Ugly Number

题目描述

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.

Example 1:

Input: 6
Output: true
Explanation: 6 = 2 × 3

Example 2:

Input: 8
Output: true
Explanation: 8 = 2 × 2 × 2

Example 3:

Input: 14
Output: false 
Explanation: 14 is not ugly since it includes another prime factor 7.

Note:

1 is typically treated as an ugly number.
Input is within the 32-bit signed integer range: [−2^31, 2^31 − 1].

解题思路 —— 递归求解

如果能 num 被 2, 3, 5, 整除，则 isUgly(num) == isUgly(num/x)，其中 x = 2 或 3 或 5

AC 代码

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