LeetCode Algorithms #263 <Ugly Number>

最新推荐文章于 2021-10-22 08:34:24 发布

NEUWYT

最新推荐文章于 2021-10-22 08:34:24 发布

阅读量233

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/neuwyt/article/details/50676909

版权

LeetCode 专栏收录该内容

37 篇文章 0 订阅

订阅专栏

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，能整除的话就把2、3、5都除掉，看最后剩下的是不是1，如果不是1就说明有其他的因数，即不是丑数，否则就是丑数。

解：

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