263. Ugly Number
来源:互联网 发布:窗户漏风 知乎 编辑:程序博客网 时间:2024/05/20 13:15
题目来源【Leetcode】
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.
用每个因子去除,看能否除尽:
class Solution {public: bool isUgly(int num) { if(num < 1) return false; for (int i=2; i < 6; i++){ while (num % i == 0) num = num/i; } return num == 1; }};
阅读全文
0 0
- 263. Ugly Number && 264. Ugly Number II
- [leetcode] 263.Ugly Number
- 263. Ugly Number
- 263. Ugly Number
- 263. Ugly Number
- 263. Ugly Number
- 263. Ugly Number
- 263. Ugly Number
- 263. Ugly Number
- 263. Ugly Number LeetCode
- 263. Ugly Number
- 263. Ugly Number
- 263. Ugly Number
- 263. Ugly Number
- 263. Ugly Number
- [LeetCode]263. Ugly Number
- 263. Ugly Number
- 263. Ugly Number
- 修改Tomcat端口号,变更失效或不起作用如何解决?
- CTF实验吧-who are you?【基于sleep盲注脚本】
- docker 插件开发案例
- RobotFramwork 使用input text时报错Parameters were incorrect. We wanted {"required":["value"]} and you……
- cordova battery-status插件
- 263. Ugly Number
- POJ 2773, POJ 3906 有趣的容斥原理
- 云客Drupal8源码分析之用户角色实体
- 世界省市区数据库
- 苹果开发者账号注册申请流程(2017.6.27)
- dsp芯片是不是正在不断的边缘化?快被arm gpu碾压了?
- 剑指offer题24
- SOAPUI中文教程---测试步骤
- sklearn浅析(二)——Generalized Linear Models之一