[Lintcode] Ugly number Ugly numbers

Write a program to check whether a given number was an ugly number '.

Ugly numbers is positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 was ugly while the is not ugly since it includes another prime factor 7.

Notice

Note that 1 are typically treated as an ugly number.

Example
Given num = 8 return True
Given num = return False

For the original question on Leetcode, please see my previous blog ugly number.

Solution One:

classSolution { Public:    /** * @param num an integer * @return true if Num was an ugly number or false*/    BOOLisugly (intnum) {         while(Num >1) {            if(num%2==0) Num/=2; Else if(num%3==0) Num/=3; Else if(num%5==0) Num/=5; Else return false; }        returnnum = =1; }};

Solution Two:

classSolution { Public:    /** * @param num an integer * @return true if Num was an ugly number or false*/    BOOLisugly (intnum) {        if(Num <=0)return false;  while(num%2==0) Num/=2;  while(num%3==0) Num/=3;  while(num%5==0) Num/=5; returnnum = =1; }};

[Lintcode] Ugly number Ugly numbers