LeetCode 263 Ugly Number

最新推荐文章于 2022-11-18 18:30:00 发布

原创最新推荐文章于 2022-11-18 18:30:00 发布 · 575 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

LeetCode 同时被 2 个专栏收录

334 篇文章

订阅专栏

Leetcode Easy

48 篇文章

订阅专栏

本文介绍了一种简单有效的算法来判断一个数是否为丑数。丑数定义为只包含质因数2、3和5的正整数。文章通过示例解释了如何通过连续除以2、3和5来简化问题，并最终确定一个数是否符合丑数的标准。

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.

题目链接：https://leetcode.com/problems/ugly-number/

题目分析：除除就好

public class Solution {
    public boolean 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;
        }
        return num == 1;
    }
}