263. Ugly Number

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

Yingying_code

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

阅读量167

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/alwaystry/article/details/52186280

leetcode 专栏收录该内容

261 篇文章

订阅专栏

本文介绍了一种使用Python编写的简单方法来判断一个给定的正整数是否为丑数。丑数定义为仅包含质因数2、3和5的正整数。文章提供了两个实现方法，并解释了其工作原理。

摘要生成于 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.

My code:

class Solution(object):
    def isUgly(self, num):
        """
        :type num: int
        :rtype: bool
        """
        if num ==1:
            return True
        if num<=0:
            return False
        while num % 2 ==0:
            num = num/2
        while num % 3 ==0:
            num =num/3
        while num % 5 ==0:
            num =num5

        return num ==1

    def isUgly0(self, num):
        """
        :type num: int
        :rtype: bool
        """
        if num<=0:
            return False
        if num ==0:
            return True
        for i in 2,3,5:
            while num% i ==0:
                num =num/i
        return num ==1