首页 > 其他 > 详细

Leetcode: Ugly Number

时间:2015-12-23 08:07:39      阅读:189      评论:0      收藏:0      [点我收藏+]
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.

recursively divide the number by 2,3,5 until finally reaches 1(true) or can‘t be divided by 2,3,5

 1 public class Solution {
 2     public boolean isUgly(int num) {
 3         if (num <= 0) return false;
 4         while (num != 1) {
 5             if (num % 2 == 0) num /= 2;
 6             else if (num % 3 == 0) num /= 3;
 7             else if (num % 5 == 0) num /= 5;
 8             else return false;
 9         }
10         return true;
11     }
12 }

 

Leetcode: Ugly Number

原文:http://www.cnblogs.com/EdwardLiu/p/5068748.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!