小白笔记-------------------leetcode(263. Ugly Number )
2016-11-19 20:36
435 查看
Write a program to check whether a given number is an ugly number.
Ugly numbers are positive numbers whose prime factors only include
Note that
先求出所有质因子然后判断,结果程序超时了。。。。、
采用简单的思路对这个数一直用2,3,5来整除最终能得到1则一定是丑数,简单可行
Ugly numbers are positive numbers whose prime factors only include
2, 3, 5. For example,
6, 8are ugly while
14is not ugly since it includes another prime factor
7.
Note that
1is typically treated as an ugly number.
先求出所有质因子然后判断,结果程序超时了。。。。、
bool isUgly(int num) { bool flag = true; if(num < 1){ flag = false; } int i,f[num]; for(i = 0 ;i < num;i++){ f[i] = 0; } for(i = 2; i*i < num;i++){ if( num % i == 0){ f[i]++; } while( num % i == 0){ num = num/i; } } for(i = 2; i < num;i++){ if(f[i] == 1 && (i != 2 || i != 3 || i != 5) ){ flag = false; } } return flag; }
采用简单的思路对这个数一直用2,3,5来整除最终能得到1则一定是丑数,简单可行
bool isUgly(int num) { if(num < 1){ return false; } while(num % 2 == 0){ num = num / 2; } while(num % 3 == 0){ num = num / 3; } while(num % 5 == 0){ num = num / 5; } return num == 1; }
相关文章推荐
- 小白笔记----------------------leetcode(9. Palindrome Number)
- 小白笔记-------------------------------------leetcode(136. Single Number )
- 【leetcode刷题笔记】Excel Sheet Column Number
- 【LeetCode】263. Ugly Number
- [leetcode] 263. Ugly Number
- LeetCode 263. Ugly Number
- LeetCode 263. Ugly Number 264 Ugly Number II 313 Super Ugly Number
- 【leetcode刷题笔记】Letter Combinations of a Phone Number
- leetcode笔记—生成最大的 数组Create Maximum Number
- [leetcode] 263. Ugly Number
- leetcode 263. Ugly Number
- Leetcode 263. Ugly Number
- 【LeetCode】263. Ugly Number
- leetcode笔记:Super Ugly Number
- leetcode笔记:Ugly Number II
- LeetCode *** 263. Ugly Number
- 【leetcode刷题笔记】Single Number II
- leetcode笔记:Leetcode Letter Combinations of a Phone Number
- Leetcode ☞ 263. Ugly Number ☆ 【附求质数 prime number 最大公约gcd 最小公倍lcm】
- LeetCode笔记:171. Excel Sheet Column Number