【LeetCode】(263)Ugly Number(Easy)
来源:互联网 发布:软件业务需求分析 编辑:程序博客网 时间:2024/05/29 04:18
题目
Ugly Number
Total Accepted: 4084 Total Submissions: 12843My SubmissionsWrite 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.
Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.
解析
很简单,能被2,3,5整除的时候就把数字除以他们,遇到除不尽的时候就说明不是了。
需要特殊考虑0 和 1.
代码如下
class Solution {public: bool isUgly(int num) { if (num == 1) return true; else 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; }};
0 0
- 【LeetCode】(263)Ugly Number(Easy)
- leetcode 263[easy]---Ugly Number
- <LeetCode><Easy>263 Ugly Number (因式分解)
- [leetcode][easy]263. Ugly Number
- Leetcode 263. Ugly Number (Easy) (cpp)
- 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
- 【LeetCode】263Ugly Number
- 【LEETCODE】263-Ugly Number
- LeetCode 263 Ugly Number
- LeetCode 263:Ugly Number
- 杭电1045
- iBatis调用存储过程的方法
- 博弈
- java静态绑定和动态绑定小结
- android 组件SeekBar实例
- 【LeetCode】(263)Ugly Number(Easy)
- 实习中
- day9: 内存管理初级:内存管理的方式、引用计数机制,影响计数的各个方法、dealloc方法、内存管理的基本原则
- word文档转换为PDF、jpg、HTML、txt、swf
- 队列
- windows编程之剪切板
- SVN chechout 错误: xxx is not valid as filename in directory
- 基于网页可信特征的信息可信度评估方法(IEEE2011)
- RuntimeException