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. 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.

Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

Subscribe to see which companies asked this question.


思路

判断数能否被2,3,5整除,不能返回false,能的话做除法再递归,直到值为1为止


代码

class Solution {
public:
    bool canBeUglyNum(int &num)
    {
        int numFlag[3] = {2,3,5};

        for(int i=0;i<sizeof(numFlag)/sizeof(int);i++)
        {
            if(num % numFlag[i] == 0)
            {
                num /= numFlag[i];
                return true;
            }
        }

        return false;
    }

    bool isUgly(int num) {
        if(num < 1)
        {
            return false;
        }

        while(num > 1)
        {
            if(!canBeUglyNum(num))
            {
                return false;
            }
        }

        return true;
    }
};
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值