https://leetcode.com/problems/ugly-number/description/
Ugly Number - LeetCode
Ugly Number - An ugly number is a positive integer whose prime factors are limited to 2, 3, and 5. Given an integer n, return true if n is an ugly number. Example 1: Input: n = 6 Output: true Explanation: 6 = 2 × 3 Example 2: Input: n = 1 Output: true
leetcode.com
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
|
class Solution:
def isUgly(self, n: int) -> bool:
if n ==0:
return False
while 1:
if n%5 == 0:
n//=5
else:
break
while 1:
if n%2 == 0:
n//=2
else:
break
while 1:
if n%3 == 0:
n//=3
else:
break
if n == 1:
return True
else:
return False
|
cs |
반응형
'python-algorithm' 카테고리의 다른 글
| leetcode 2535. Difference Between Element Sum and Digit Sum of an Array (0) | 2023.01.17 |
|---|---|
| leetcode 326. Power of Three (0) | 2023.01.17 |
| leetcode 231. Power of Two (0) | 2023.01.17 |
| 백준 27219 Робинзон Крузо (0) | 2023.01.16 |
| leetcode 1446. Consecutive Characters (0) | 2023.01.14 |
댓글