首页 > itarticle > leetcode 0263

leetcode 0263

admin 11月 13, 2020 0

Desicription

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.

Example 1:

1
2
3
 
Input: 6
Output: true
Explanation: 6 = 2 × 3

Example 2:

1
2
3
 
Input: 8
Output: true
Explanation: 8 = 2 × 2 × 2

Example 3:

1
2
3
 
Input: 14
Output: false 
Explanation: 14 is not ugly since it includes another prime factor 7.

Note:

  1. 1 is typically treated as an ugly number.
  2. Input is within the 32-bit signed integer range: [−2^31, 2^31 − 1].

Solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
 
class  {
private:
public:
    bool isUgly(int num) {
        if(!num) {
            return false;
        }
        while(!(num % 2)) {
            num /= 2;
        }
        while(!(num % 3)) {
            num /= 3;
        }
        while(!(num % 5)) {
            num /= 5;
        }
        return num == 1;
    }
};
微海报分享

近期文章

近期评论

标签

热门

文章归档

分类目录

功能