zoukankan      html  css  js  c++  java
  • [leetcode-263-Ugly Number]

    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.

    思路:

    将num一直除以 2,3,5,一直到没法除为止,判断结果是否为1。

    bool isUgly(int num)
     {
            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;
        if(num!=1) return false;
        return true;    
     }
  • 相关阅读:
    R
    P
    O
    M
    二分算法的一些思考
    I
    H
    G
    5-46 新浪微博热门话题 (30分)——unfinished HASH
    BZOJ 1179: [Apio2009]Atm
  • 原文地址:https://www.cnblogs.com/hellowooorld/p/6880614.html
Copyright © 2011-2022 走看看