LeetCode 0263 - Ugly Number

Reck Zhang

发布于 2021-08-11 11:47:07

1250

发布于 2021-08-11 11:47:07

文章被收录于专栏：Reck Zhang

Ugly Number

Desicription

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

Solution

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

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2018-12-12，如有侵权请联系 cloudcommunity@tencent.com 删除

bit