LeetCode题解:Ugly Number
来源:互联网 发布:青岛吉利知豆租赁 编辑:程序博客网 时间:2024/04/29 19:40
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.
题意:判断一个给定整数的质因数是否只有2,3,5。其中1符合题意
解决思路:循环除以质因数2,3,5。最后结果为1则符合题意
代码:
public class Solution { public boolean isUgly(int num) { if(num < 1){ return false; } while(num != 1){ if(num % 2 == 0){ num /= 2; }else if(num % 3 == 0){ num /= 3; }else if(num % 5 == 0){ num /= 5; }else{ return false; } } return true; }}
0 0
- LeetCode题解:Ugly Number
- LeetCode题解:Ugly Number
- LeetCode 题解(187): Ugly Number
- Leetcode题解 263. Ugly Number
- LeetCode 题解(188): Ugly Number II
- LeetCode题解——Ugly Number II
- leetcode 264. Ugly Number II 题解
- leetcode之Ugly Number && Ugly Number II
- leetcode - Ugly Number、Ugly Number II 、Super Ugly Number
- LeetCode: Ugly Number
- [leetcode][math] Ugly Number
- Leetcode -- Ugly Number II
- [leetcode] Ugly Number
- [leetcode] 263.Ugly Number
- LeetCode: Ugly Number II
- [LeetCode] Ugly Number
- leetcode 263: Ugly Number
- leetCode #263 Ugly Number
- LeetCode题解:String to Integer (atoi)
- CDMA系统的远近效应问题
- MFC中CSplitter的应用以及在View中添加按钮
- 46家公司程序题答案,均通过上机验证
- POJ 题目1105 S-Trees(二叉树模拟)
- LeetCode题解:Ugly Number
- Spring注解@Component、@Repository、@Service、@Controller区别
- hdu 2096 小明A+B 刷题
- Windows下配置的环境变量未生效
- LeetCode题解:ZigZag Conversion
- [C++]Rotate Array 旋转数组
- 仿UC浏览器项目源码
- acmoj*
- UNIX环境高级编程之第5章:标准I/O库-习题