-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathugly-number.py
More file actions
52 lines (50 loc) · 940 Bytes
/
Copy pathugly-number.py
File metadata and controls
52 lines (50 loc) · 940 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
# 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:
#
#
# Input: 6
# Output: true
# Explanation: 6 = 2 × 3
#
# Example 2:
#
#
# Input: 8
# Output: true
# Explanation: 8 = 2 × 2 × 2
#
#
# Example 3:
#
#
# Input: 14
# Output: false
# Explanation: 14 is not ugly since it includes another prime factor 7.
#
#
# Note:
#
#
# 1 is typically treated as an ugly number.
# Input is within the 32-bit signed integer range: [−231, 231 − 1].
#
class Solution:
def isUgly(self, num):
"""
:type num: int
:rtype: bool
"""
if num== 1:
return True
if num == 0:
return False
while(num%2 == 0):
num = num/2
while(num%3 == 0):
num = num/3
while(num%5 == 0):
num = num/5
return num == 1