-
Notifications
You must be signed in to change notification settings - Fork 2
/
minimumpathsum_test.go
66 lines (62 loc) · 1.06 KB
/
minimumpathsum_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
package minimumpathsum
import (
"testing"
"github.com/WindomZ/testify/assert"
)
func Test_minPathSum(t *testing.T) {
assert.Empty(t, minPathSum([][]int{{0}}))
assert.Equal(t, 4, minPathSum([][]int{
{1, 2},
{2, 1},
}))
assert.Equal(t, 4, minPathSum([][]int{
{1, 2},
{3, 1},
}))
assert.Equal(t, 7, minPathSum([][]int{
{1, 3, 1},
{1, 5, 1},
{4, 2, 1},
}))
assert.Equal(t, 10, minPathSum([][]int{
{1, 3, 1, 2},
{1, 5, 2, 2},
{4, 2, 1, 2},
}))
assert.Equal(t, 11, minPathSum([][]int{
{1, 3, 1, 2},
{1, 5, 2, 2},
{4, 2, 1, 2},
{1, 0, 4, 1},
}))
}
func Benchmark_minPathSum(b *testing.B) {
b.StopTimer()
b.ReportAllocs()
b.StartTimer()
b.RunParallel(func(pb *testing.PB) {
for pb.Next() {
minPathSum([][]int{{0}})
minPathSum([][]int{
{1, 2},
{2, 1},
})
minPathSum([][]int{
{1, 3, 1},
{1, 5, 1},
{4, 2, 1},
})
minPathSum([][]int{
{1, 3, 1, 2},
{1, 5, 2, 2},
{4, 2, 1, 2},
})
minPathSum([][]int{
{1, 3, 1, 2},
{1, 5, 2, 2},
{4, 2, 1, 2},
{1, 0, 4, 1},
})
}
})
}