263.Ugly Number
来源:互联网 发布:windows阻止软件自启 编辑:程序博客网 时间:2024/06/03 15:51
/* 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. *///解法一 6msint fun(int num){ if(num%2==0) num=num/2; else if(num%3==0) num=num/3; else if(num%5==0) num=num/5; if(num%2==0||num%3==0||num%5==0) num = fun(num); if(num==1) return 1; return 0;}bool isUgly(int num) { int i; int k; if(num<=0) return false; if(num==1) return true; k=fun(num); if(k==1) return true; else return false; return;}//解法二 3msbool isUgly(int num) { int i; for(i=2;i<6&#i++) while(num%i==0) num/=i; if(num==1) return true; else return false;}
阅读全文
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
- 最小生成树模板
- 浅谈单片机、ARM和DSP的异同——非常透彻
- c++ linux下安全启动进程收集
- 数据库操作练习6
- 【二叉树经典问题】145. Binary Tree Postorder Traversal
- 263.Ugly Number
- hdu 1215 七夕节
- mysql面试--引擎MyISAM与InnoDB的区别
- ubantu16.04安装tensorflow(GPU)+cuda8.0+cudnn6.0
- PAT 甲级 1002. A+B for Polynomials
- Android IPC之代理模式
- HDU
- 264.Ugly Number II
- 溢出能覆盖变量当然也能覆盖地址