mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2026-03-13 10:02:05 +08:00
添加 problem 263
This commit is contained in:
10
Algorithms/263. Ugly Number/263. Ugly Number.go
Normal file
10
Algorithms/263. Ugly Number/263. Ugly Number.go
Normal file
@@ -0,0 +1,10 @@
|
||||
package leetcode
|
||||
|
||||
func isUgly(num int) bool {
|
||||
for i := 2; i < 6 && num > 0; i++ {
|
||||
for num%i == 0 {
|
||||
num /= i
|
||||
}
|
||||
}
|
||||
return num == 1
|
||||
}
|
||||
52
Algorithms/263. Ugly Number/263. Ugly Number_test.go
Normal file
52
Algorithms/263. Ugly Number/263. Ugly Number_test.go
Normal file
@@ -0,0 +1,52 @@
|
||||
package leetcode
|
||||
|
||||
import (
|
||||
"fmt"
|
||||
"testing"
|
||||
)
|
||||
|
||||
type question263 struct {
|
||||
para263
|
||||
ans263
|
||||
}
|
||||
|
||||
// para 是参数
|
||||
// one 代表第一个参数
|
||||
type para263 struct {
|
||||
one int
|
||||
}
|
||||
|
||||
// ans 是答案
|
||||
// one 代表第一个答案
|
||||
type ans263 struct {
|
||||
one bool
|
||||
}
|
||||
|
||||
func Test_Problem263(t *testing.T) {
|
||||
|
||||
qs := []question263{
|
||||
|
||||
question263{
|
||||
para263{6},
|
||||
ans263{true},
|
||||
},
|
||||
|
||||
question263{
|
||||
para263{8},
|
||||
ans263{true},
|
||||
},
|
||||
|
||||
question263{
|
||||
para263{14},
|
||||
ans263{false},
|
||||
},
|
||||
}
|
||||
|
||||
fmt.Printf("------------------------Leetcode Problem 263------------------------\n")
|
||||
|
||||
for _, q := range qs {
|
||||
_, p := q.ans263, q.para263
|
||||
fmt.Printf("【input】:%v 【output】:%v\n", p, isUgly(p.one))
|
||||
}
|
||||
fmt.Printf("\n\n\n")
|
||||
}
|
||||
44
Algorithms/263. Ugly Number/README.md
Normal file
44
Algorithms/263. Ugly Number/README.md
Normal file
@@ -0,0 +1,44 @@
|
||||
# [263. Ugly Number](https://leetcode.com/problems/ugly-number/)
|
||||
|
||||
## 题目
|
||||
|
||||
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:
|
||||
|
||||
```c
|
||||
Input: 6
|
||||
Output: true
|
||||
Explanation: 6 = 2 × 3
|
||||
```
|
||||
|
||||
Example 2:
|
||||
|
||||
```c
|
||||
Input: 8
|
||||
Output: true
|
||||
Explanation: 8 = 2 × 2 × 2
|
||||
```
|
||||
|
||||
Example 3:
|
||||
|
||||
```c
|
||||
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].
|
||||
|
||||
|
||||
## 题目大意
|
||||
|
||||
判断一个数字是否是“丑陋数字”,“丑陋数字”的定义是一个正数,并且因子只包含 2,3,5 。
|
||||
|
||||
|
||||
|
||||
Reference in New Issue
Block a user