forked from halfrost/LeetCode-Go
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path30. Substring with Concatenation of All Words_test.go
92 lines (74 loc) · 1.46 KB
/
30. Substring with Concatenation of All Words_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
82
83
84
85
86
87
88
89
90
91
92
package leetcode
import (
"fmt"
"testing"
)
type question30 struct {
para30
ans30
}
// para 是参数
// one 代表第一个参数
type para30 struct {
one string
two []string
}
// ans 是答案
// one 代表第一个答案
type ans30 struct {
one []int
}
func Test_Problem30(t *testing.T) {
qs := []question30{
{
para30{"aaaaaaaa", []string{"aa", "aa", "aa"}},
ans30{[]int{0, 1, 2}},
},
{
para30{"barfoothefoobarman", []string{"foo", "bar"}},
ans30{[]int{0, 9}},
},
{
para30{"wordgoodgoodgoodbestword", []string{"word", "good", "best", "word"}},
ans30{[]int{}},
},
{
para30{"goodgoodgoodgoodgood", []string{"good"}},
ans30{[]int{0, 4, 8, 12, 16}},
},
{
para30{"barofoothefoolbarman", []string{"foo", "bar"}},
ans30{[]int{}},
},
{
para30{"bbarffoothefoobarman", []string{"foo", "bar"}},
ans30{[]int{}},
},
{
para30{"ooroodoofoodtoo", []string{"foo", "doo", "roo", "tee", "oo"}},
ans30{[]int{}},
},
{
para30{"abc", []string{"a", "b", "c"}},
ans30{[]int{0}},
},
{
para30{"a", []string{"b"}},
ans30{[]int{}},
},
{
para30{"ab", []string{"ba"}},
ans30{[]int{}},
},
{
para30{"n", []string{}},
ans30{[]int{}},
},
}
fmt.Printf("------------------------Leetcode Problem 30------------------------\n")
for _, q := range qs {
_, p := q.ans30, q.para30
fmt.Printf("【input】:%v 【output】:%v\n", p, findSubstring(p.one, p.two))
}
fmt.Printf("\n\n\n")
}