forked from wufenggirl/LeetCode-in-Golang
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathfind-the-shortest-superstring_test.go
executable file
·71 lines (57 loc) · 1.35 KB
/
find-the-shortest-superstring_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
package problem0943
import (
"strings"
"testing"
"github.com/stretchr/testify/assert"
)
// tcs is testcase slice
var tcs = []struct {
A []string
expected string
}{
{
[]string{"fgbabcde", "abcdefgb", "bcdei"},
"abcdefgbabcdei",
},
{
[]string{"cedefifgstkyxfcuajfa", "ooncedefifgstkyxfcua", "assqjfwarvjcjedqtoz", "fcuajfassqjfwarvjc", "fwarvjcjedqtozctcd", "zppedxfumcfsngp", "kyxfcuajfassqjfwa", "fumcfsngphjyfhhwkqa", "fassqjfwarvjcjedq", "ppedxfumcfsngphjyf", "dqtozctcdk"},
"ooncedefifgstkyxfcuajfassqjfwarvjcjedqtozctcdkzppedxfumcfsngphjyfhhwkqa",
},
{
[]string{"alex", "loves", "leetcode"},
"alexlovesleetcode",
},
{
[]string{"catg", "ctaagt", "gcta", "ttca", "atgcatc"},
"gctaagttcatgcatc",
},
// 可以有多个 testcase
}
func isCorrect(A []string, expected, actual string) bool {
if expected == actual {
return true
}
if len(expected) != len(actual) {
return false
}
for _, sub := range A {
if !strings.Contains(actual, sub) {
return false
}
}
return true
}
func Test_shortestSuperstring(t *testing.T) {
ast := assert.New(t)
for _, tc := range tcs {
actual := shortestSuperstring(tc.A)
ast.True(isCorrect(tc.A, tc.expected, actual), "输入:%v", tc)
}
}
func Benchmark_shortestSuperstring(b *testing.B) {
for i := 0; i < b.N; i++ {
for _, tc := range tcs {
shortestSuperstring(tc.A)
}
}
}