-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path263.ugly-number.go
94 lines (89 loc) · 1.52 KB
/
263.ugly-number.go
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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
/*
* @lc app=leetcode id=263 lang=golang
*
* [263] Ugly Number
*
* https://leetcode.com/problems/ugly-number/description/
*
* algorithms
* Easy (41.31%)
* Likes: 527
* Dislikes: 655
* Total Accepted: 211.2K
* Total Submissions: 508K
* Testcase Example: '6'
*
* 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: [−2^31, 2^31 − 1].
*
*/
// @lc code=start
func isUgly(num int) bool {
return isUgly3(num)
}
func isUgly3(num int) bool {
if num < 1 {
return false
}
factors := [3]int{2, 3, 5}
for _, v := range factors {
for num%v == 0 {
num /= v
}
}
return num == 1
}
func isUgly2(num int) bool {
if num == 0 {
return false
}
for i := 2; i < 6; i++ {
for num%i == 0 {
num /= i
}
}
return num == 1
}
func isUgly1(num int) bool {
if num == 0 {
return false
}
if num == 1 || num == 2 || num == 3 || num == 5 {
return true
}
if (num%2 == 0 && isUgly1(num/2)) || (num%3 == 0 && isUgly1(num/3)) || (num%5 == 0 && isUgly1(num/5)) {
return true
}
return false
}
// @lc code=end