-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain_test.go
76 lines (73 loc) · 1.45 KB
/
main_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
package main
import "testing"
func Test_longestCommonPrefix(t *testing.T) {
type args struct {
strs []string
}
tests := []struct {
name string
args args
want string
}{
{
name: "example 1",
args: args{strs: []string{"flower", "flow", "flight"}},
want: "fl",
},
{
name: "example 2",
args: args{strs: []string{"dog", "racecar", "car"}},
want: "",
},
{
name: "example 3",
args: args{strs: []string{"a"}},
want: "a",
},
{
name: "example 4",
args: args{strs: []string{"flower", "flower", "flower", "flower"}},
want: "flower",
},
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
if gotPrefix := longestCommonPrefix(tt.args.strs); gotPrefix != tt.want {
t.Errorf("longestCommonPrefix() = %v, want %v", gotPrefix, tt.want)
}
})
}
}
func Test_longestCommonPrefixSets(t *testing.T) {
type args struct {
strs []string
}
tests := []struct {
name string
args args
want string
}{
{
name: "example 1",
args: args{strs: []string{"flower", "flow", "flight"}},
want: "fl",
},
{
name: "example 2",
args: args{strs: []string{"dog", "racecar", "car"}},
want: "",
},
{
name: "example 3",
args: args{strs: []string{"a"}},
want: "a",
},
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
if got := longestCommonPrefixSets(tt.args.strs); got != tt.want {
t.Errorf("longestCommonPrefixSets() = %v, want %v", got, tt.want)
}
})
}
}