leetcode263. Ugly Number（丑数）JAVA实现

最新推荐文章于 2022-09-28 09:44:12 发布

我是叫帽帽啊

最新推荐文章于 2022-09-28 09:44:12 发布

阅读量395

点赞数

分类专栏： LeetCode 文章标签： java LeetCode

本文链接：https://blog.csdn.net/qq_25406563/article/details/84477049

版权

LeetCode 专栏收录该内容

57 篇文章 0 订阅

订阅专栏

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

实现思路：递归实现

class Solution {
    public boolean isUgly(int num) {
        if(num==0) return false;
        if(num==1) return true;
        if(num%2==0){
            num=num/2;
            return isUgly(num);
        }
        if(num%3==0){
            num=num/3;
            return isUgly(num);
        }
        if(num%5==0){
            num=num/5;
            return isUgly(num);
        }
        return false;
    }
}