[Leetcode-263] Ugly Number(丑陋数)
来源:互联网 发布:网络打印四六级成绩单 编辑:程序博客网 时间:2024/06/03 23: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.
【分析】思路:根据丑陋数的定义,我们将给定数除以2、3、5,直到无法整除,也就是除以2、3、5的余数不再为0时停止。这时如果得到1,说明是所有因子都是2或3或5,如果不是1,则不是丑陋数。
bool isUgly(int num) { if(num<=0) return 0; int rem2 = num % 2; int rem3 = num % 3; int rem5 = num % 5; while(rem2 == 0 || rem3 == 0 || rem5 == 0) { if(rem2 == 0) { num = num / 2; } else if(rem3 == 0) { num = num / 3; } else { num = num / 5; } rem2 = num % 2; rem3 = num % 3; rem5 = num % 5; } return num == 1;}
2 0
- [Leetcode-263] Ugly Number(丑陋数)
- LeetCode 263 Ugly Number(丑数)
- Ugly Number | Leetcode 丑数
- 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
- [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
- LeetCode 263:Ugly Number
- PE文件详解之区块表
- 数据结构之队列
- Python爬虫框架--pyspider初体验
- 生命游戏(Java)
- POJ 2255 二叉树由前序遍历中序遍历得到后序遍历
- [Leetcode-263] Ugly Number(丑陋数)
- Tomcat基本知识
- Android Api Demos登顶之路(五十七)Service Remote Service Binding options
- 设计模式之 ——策略模式
- C++ vector用法
- 用Rails-2.1.6搭建一个web项目的步骤(修正)
- 浏览器显示网页的机制
- 若不想使用编译器默认生成的函数,就该拒绝(Effective C++_6)
- 零基础学python-11.2 python语法规则