LeetCode--No.263--Ugly Number
2016-06-15 03:14
281 查看
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
public class Solution {
public boolean isUgly(int num) {
if (num <=0)
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;
}
}
这样写会超时。因为会进行很多不必要的判断条件。
public class Solution {
public boolean isUgly(int num) {
if (num <=0)
return false;
if (num<=5)
return true;
while(num >=5){
if(num % 2 == 0)
num /= 2;
if(num % 3 == 0)
num /= 3;
if(num % 5 == 0)
num /= 5;
}
if(num < 5)
return true;
else
return false;
}
}
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.
public class Solution {
public boolean isUgly(int num) {
if (num <=0)
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;
}
}
这样写会超时。因为会进行很多不必要的判断条件。
public class Solution {
public boolean isUgly(int num) {
if (num <=0)
return false;
if (num<=5)
return true;
while(num >=5){
if(num % 2 == 0)
num /= 2;
if(num % 3 == 0)
num /= 3;
if(num % 5 == 0)
num /= 5;
}
if(num < 5)
return true;
else
return false;
}
}
相关文章推荐
- java异常与错误备忘
- LeetCode--No.231--Power Of Two
- 用BeautifulSoup,urllib,requests写twitter爬虫(1)
- LeetCode--No.326--Power of Three
- UML图中类之间的关系:依赖,泛化,关联,聚合,组合,实现
- 设计模式(一)工厂模式Factory(创建型)
- Sublime3中快捷键的设置
- Combination Sum
- Python \x invalid escape error 和 windows 下的文件路径使用问题
- php类中静态变量与常亮的区别
- Android Studio打包全攻略---从入门到精通
- 四则运算app代码上传GITHUB
- connect函数详解
- nodejs读取图片像素
- IIS设置不合理导致的外网无法访问服务器的解决方法
- 电脑通过vnc控制android 手机
- 【Web】C++ Http -- 记一次使用第三方http请求的问题解决
- BAT纷纷入局,云游戏低调崛起
- LeetCode 357. Count Numbers with Unique Digits(计算无重复数字)
- ios学习路线—Objective-C(MRC)