leetcode 263. Ugly Number
来源:互联网 发布:知乎关于网络文章 编辑:程序博客网 时间:2024/05/16 10:48
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.
public boolean isUgly(int num) {if(num<=0){return false;}while(num>1){if(num%2==0){num=num/2;}else if(num%3==0){num=num/3;}else if(num%5==0){num=num/5;}else{return false;}}return true;}大神的方法也跟我差不多。先把一个除数除尽了,再除以另外一个除数。
public class Solution { public static boolean isUgly(int num) { if (num <= 0) { return false; } int[] divisors = {2, 3, 5}; for(int d : divisors) { while (num % d == 0) { num /= d; } } return num == 1; }}
阅读全文
0 0
- [leetcode] 263.Ugly Number
- 263. Ugly Number LeetCode
- [LeetCode]263. Ugly Number
- leetcode 263. Ugly Number
- Leetcode 263. Ugly Number
- LeetCode *** 263. Ugly Number
- [leetcode] 263. Ugly Number
- leetcode 263. Ugly Number
- LeetCode 263. Ugly Number
- #leetcode#263.Ugly Number
- LeetCode 263. Ugly Number
- 263.[LeetCode]Ugly Number
- Leetcode 263. Ugly Number
- [leetcode] 263. Ugly Number
- [Leetcode]263. Ugly Number
- 【leetcode】263. Ugly Number
- leetcode 263. Ugly Number
- 【leetcode】263. Ugly Number
- 重入锁ReentrantLock
- linux下jps报command not found
- 二叉树的遍历
- JS对象简单操作
- 深拷贝构造函数
- leetcode 263. Ugly Number
- 2017"百度之星"程序设计大赛
- Storm架构与运行原理
- 不同的业务逻辑如何发送一个action请求返回不同的数据
- 函数中局部变量的返回
- 按会员优惠计划进行购物结算
- 2017"百度之星"程序设计大赛
- Material Design 系列(3)—AppbarLayout
- node.js 压力测试框架.01