[LeetCode]263. Ugly Number
来源:互联网 发布:南天软件待遇 编辑:程序博客网 时间:2024/06/05 12: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.
1. 将该数一直除以2/3/5,看最后是不是1
class Solution {public: bool isUgly(int num) { if (num <=0) 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 0; } return num == 1; }};
2.solution里的的办法
bool isUgly(int num) { int i; for (i=2;i<=5&&num>0;i++) { while(num%i==0) num/= i; } 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
- Oracle笔记(八) 复杂查询及总结
- PNG文件结构分析 ---Png解析
- SylixOS中AHCI驱动框架分析
- C++中的类,类中定义该类的指针的用途
- DHTML技术综合演示---示例:表格行间隔显示
- [LeetCode]263. Ugly Number
- HDU5835-Danganronpa
- Java多线程系列--“JUC集合”08之 LinkedBlockingQueue
- AsyncTask(异步)和Thread(线程)的使用与对比
- Oracle笔记(九) 表的创建及管理
- 一些Java面试题
- 深度学习
- /***/二叉树经典面试题之判断一棵二叉树是否是完全二叉树
- Java多线程系列--“JUC集合”09之 LinkedBlockingDeque