首页 > 其他 > 详细

lintcode-easy-Ugly Number

时间:2016-04-07 07:08:10      阅读:199      评论: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,35. For example, 68 are ugly while 14 is not ugly since it includes another prime factor 7.

 

Notice

Note that 1 is typically treated as an ugly number.

Example

Given num = 8 return true
Given num = 14 return false

 

public class Solution {
    /**
     * @param num an integer
     * @return true if num is an ugly number or false
     */
    public boolean isUgly(int num) {
        // Write your code here
        if(num <= 0)
            return false;
        
        if(num == 1)
            return true;
        
        while(num % 2 == 0)
            num /= 2;
        
        while(num % 3 == 0)
            num /= 3;
        
        while(num % 5 == 0)
            num /= 5;
        
        return num == 1;
    }
}

 

lintcode-easy-Ugly Number

原文:http://www.cnblogs.com/goblinengineer/p/5361960.html

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