263. Ugly Number
2016-02-25 19:41
369 查看
题目:
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 == 1){return true;}
if(num < 1){return false;}
while(num%2 == 0){
num /= 2;
}
while(num%3 == 0){
num /= 3;
}
while(num%5 == 0){
num /= 5;
}
if(num == 1){
return true;
}else{
return false;
}
}
}
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, 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 == 1){return true;}
if(num < 1){return false;}
while(num%2 == 0){
num /= 2;
}
while(num%3 == 0){
num /= 3;
}
while(num%5 == 0){
num /= 5;
}
if(num == 1){
return true;
}else{
return false;
}
}
}
相关文章推荐
- java对世界各个时区(TimeZone)的通用转换处理方法(转载)
- java-注解annotation
- java-模拟tomcat服务器
- java-用HttpURLConnection发送Http请求.
- java-WEB中的监听器Lisener
- Android IPC进程间通讯机制
- Android Native 绘图方法
- Android java 与 javascript互访(相互调用)的方法例子
- 介绍一款信息管理系统的开源框架---jeecg
- 聚类算法之kmeans算法java版本
- java实现 PageRank算法
- PropertyChangeListener简单理解
- c++11 + SDL2 + ffmpeg +OpenAL + java = Android播放器
- 插入排序
- 冒泡排序
- 堆排序
- 快速排序
- 二叉查找树