LeetCode 263. Ugly Number – 柳婼の blog

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.

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

class Solution {

public:

bool isUgly(int num) {

if(num <= 0) {

return false;

}

int flag = 0;

while(num != 1) {

flag = 0;

if(num % 2 == 0) {

num = num / 2;

flag = 1;

}

if(num % 3 == 0) {

num = num / 3;

flag = 1;

}

if(num % 5 == 0) {

num = num / 5;

flag = 1;

}

if(flag == 0) {

return false;

}

return true;

}

};

❤ 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼

❤ 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼

❤ 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版