-
Notifications
You must be signed in to change notification settings - Fork 2
/
q0263.swift
61 lines (60 loc) · 1.12 KB
/
q0263.swift
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
53
54
55
56
57
58
59
60
61
//
// q0263.swift
// LeetcodeSwift
//
// Created by NowOrNever on 05/07/2020.
// Copyright © 2020 DL. All rights reserved.
//
import Foundation
//263. Ugly Number
//Easy
//
//463
//
//622
//
//Add to List
//
//Share
//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].
//Accepted
//202,612
//Submissions
//489,477
class q0263Solution {
func isUgly(_ num: Int) -> Bool {
if num < 1 {
return false
}
let factors = [2,3,5]
var result = num
for factor in factors {
while result % factor == 0 {
result = result / factor
}
}
return result == 1
}
}