LeetCode263 Ugly Number

最新推荐文章于 2023-12-15 20:03:18 发布

tigerhuli

最新推荐文章于 2023-12-15 20:03:18 发布

阅读量83

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/m0_37518259/article/details/90678559

版权

LeetCode 专栏收录该内容

503 篇文章 3 订阅

订阅专栏

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

思路：

既然事因式分解，那我们就直接除就可以了，当然，小于等于0的数直接判为false。

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