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



#include <iostream>
using namespace std;

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;
  }
};

int main()
{
  Solution s;
  int x;
  cin >> x;
  cout << s.isUgly(x) << endl;
  
  return 0;
}

Although I saw "positive numbers" in the question, the test cases will test 0 as the input.

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值