LeetCode--263--easy--UglyNumber

微观尽头

于 2020-01-09 19:53:50 发布

阅读量137

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/huangdingsheng/article/details/103914791

版权

LeetCode 专栏收录该内容

199 篇文章 0 订阅

订阅专栏

本文详细探讨了LeetCode上的第263题——丑数。丑数是指只包含质因数2、3和5的正整数。文章介绍了如何通过迭代方法判断一个数是否为丑数，并提供了具体的Python代码实现。

摘要由CSDN通过智能技术生成

package com.app.main.LeetCode;

/**
 * 263
 *
 * easy
 *
 * 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.
 * Note:
 *
 * 1 is typically treated as an ugly number.
 * Input is within the 32-bit signed integer range: [−231,  231 − 1].
 *
 *
 * Created with IDEA
 * author:Dingsheng Huang
 * Date:2019/12/24
 * Time:下午9:08
 */
public class UglyNumber {

    public boolean isUgly(int num) {
        if (num == 0) {
            return false;
        }
        while (num != 1 && num % 2 == 0) {
            num = num / 2;
        }
        while (num != 1 && num % 3 == 0) {
            num = num / 3;
        }
        while (num != 1 && num % 5 == 0) {
            num = num / 5;
        }
        return num == 1;
    }

}