leetcode 263 Ugly Number

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

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

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

127 篇文章

订阅专栏

本文介绍了一种使用C++编程语言来判断一个给定的正整数是否为丑数的方法。丑数定义为仅包含质因数2、3和5的正整数。文章提供了一个简洁的C++代码示例，该示例通过去除输入数字的所有2、3和5的因子，检查剩余部分是否为1来判断其是否为丑数。

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.

Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

class Solution {
public:
	bool isUgly(int num) {
		if(num <= 0) return false;
		if(num == 1) return true;

		for(int i=2; i<6 && num>0; i++) {
			while(n%i==0)
				num = num/i;
		}

		return num==1;
	}
}