#Leetcode# 263. Ugly Number

最新推荐文章于 2024-09-12 22:32:25 发布

weixin_30466039

最新推荐文章于 2024-09-12 22:32:25 发布

阅读量58

点赞数

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/zlrrrr/p/10697923.html

版权

https://leetcode.com/problems/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.

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.

代码：

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

　　不开心想吃煲仔饭想溜溜

转载于:https://www.cnblogs.com/zlrrrr/p/10697923.html