leetcode 263. Ugly Number
阿里云国内75折 回扣 微信号:monov8 |
阿里云国际,腾讯云国际,低至75折。AWS 93折 免费开户实名账号 代冲值 优惠多多 微信号:monov8 飞机:@monov6 |
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:
14
7
Note:
-
1
is typically treated as an ugly number. - Input is within the 32-bit signed integer range: [−231, 231 − 1].
class Solution(object):
def isUgly(self, num):
"""
:type num: int
:rtype: bool
"""
# greddy
if num <= 0: return False
for x in [2, 3, 5]:
while num % x == 0:
num = num / x
return num == 1
阿里云国内75折 回扣 微信号:monov8 |
阿里云国际,腾讯云国际,低至75折。AWS 93折 免费开户实名账号 代冲值 优惠多多 微信号:monov8 飞机:@monov6 |