forked from halfrost/LeetCode-Go
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path179. Largest Number_test.go
81 lines (65 loc) · 1.11 KB
/
179. Largest Number_test.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
package leetcode
import (
"fmt"
"testing"
)
type question179 struct {
para179
ans179
}
// para 是参数
// one 代表第一个参数
type para179 struct {
one []int
}
// ans 是答案
// one 代表第一个答案
type ans179 struct {
one string
}
func Test_Problem179(t *testing.T) {
qs := []question179{
{
para179{[]int{3, 6, 9, 1}},
ans179{"9631"},
},
{
para179{[]int{1}},
ans179{"1"},
},
{
para179{[]int{}},
ans179{""},
},
{
para179{[]int{2, 10}},
ans179{"210"},
},
{
para179{[]int{3, 30, 34, 5, 9}},
ans179{"9534330"},
},
{
para179{[]int{12, 128}},
ans179{"12812"},
},
{
para179{[]int{12, 121}},
ans179{"12121"},
},
{
para179{[]int{0, 0}},
ans179{"0"},
},
{
para179{[]int{1440, 7548, 4240, 6616, 733, 4712, 883, 8, 9576}},
ans179{"9576888375487336616471242401440"},
},
}
fmt.Printf("------------------------Leetcode Problem 179------------------------\n")
for _, q := range qs {
_, p := q.ans179, q.para179
fmt.Printf("【input】:%v 【output】:%v\n", p, largestNumber(p.one))
}
fmt.Printf("\n\n\n")
}