forked from wufenggirl/LeetCode-in-Golang
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsmallest-sufficient-team_test.go
executable file
·63 lines (53 loc) · 1.67 KB
/
smallest-sufficient-team_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
package problem1125
import (
"testing"
"github.com/stretchr/testify/assert"
)
// tcs is testcase slice
var tcs = []struct {
reqs []string
people [][]string
ans []int
}{
{
[]string{"rxocajdeo", "mymflnlegtrnr", "xbyqqh", "jarzoaupviqkx", "sfgstfsqlqmfjv", "lpnpelpwy", "pyqrhjamdrias"},
[][]string{{"pyqrhjamdrias"}, {"rxocajdeo", "pyqrhjamdrias"}, {}, {"rxocajdeo"}, {"mymflnlegtrnr", "jarzoaupviqkx"}, {}, {"rxocajdeo"}, {}, {"sfgstfsqlqmfjv"}, {"rxocajdeo"}, {"pyqrhjamdrias"}, {}, {}, {}, {"lpnpelpwy"}, {}, {"rxocajdeo", "mymflnlegtrnr"}, {"rxocajdeo"}, {"xbyqqh", "pyqrhjamdrias"}, {"mymflnlegtrnr"}},
[]int{3, 4, 8, 14, 18},
},
{
[]string{"java", "nodejs", "reactjs"},
[][]string{{"java"}, {"nodejs"}, {"nodejs", "reactjs"}},
[]int{0, 2},
},
{
[]string{"algorithms", "math", "java", "reactjs", "csharp", "aws"},
[][]string{{"algorithms", "math", "java"}, {"algorithms", "math", "reactjs"}, {"java", "csharp", "aws"}, {"reactjs", "csharp"}, {"csharp", "math"}, {"aws", "java"}},
[]int{1, 2},
},
// 可以有多个 testcase
}
func Test_smallestSufficientTeam(t *testing.T) {
ast := assert.New(t)
for _, tc := range tcs {
skillMap := make(map[string]bool, len(tc.reqs))
indexs := smallestSufficientTeam(tc.reqs, tc.people)
for _, i := range indexs {
for _, s := range tc.people[i] {
skillMap[s] = true
}
}
for _, r := range tc.reqs {
_, ok := skillMap[r]
ast.True(ok, "组合中应该含有 %s 技能", r)
delete(skillMap, r)
}
ast.Equal(0, len(skillMap))
}
}
func Benchmark_smallestSufficientTeam(b *testing.B) {
for i := 0; i < b.N; i++ {
for _, tc := range tcs {
smallestSufficientTeam(tc.reqs, tc.people)
}
}
}