-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdynamic_programming_test.go
More file actions
162 lines (157 loc) · 2.85 KB
/
dynamic_programming_test.go
File metadata and controls
162 lines (157 loc) · 2.85 KB
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
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
package grokking_algorithms
import (
"testing"
"github.com/stretchr/testify/assert"
)
func TestDynamicKnapsack(t *testing.T) {
type args struct {
elements []Element
totalSize int
}
tests := []struct {
name string
args args
want Table
wantMaxPrice int
}{
{
"three items",
args{
elements: []Element{
{Name: "guitar", Size: 1, Price: 1500},
{Name: "recorder", Size: 4, Price: 3000},
{Name: "notebook", Size: 3, Price: 2000},
},
totalSize: 4,
},
[][]int{
{1500, 1500, 1500, 1500},
{1500, 1500, 1500, 3000},
{1500, 1500, 2000, 3500},
},
3500,
},
{
"four items",
args{
elements: []Element{
{Name: "guitar", Size: 1, Price: 1500},
{Name: "recorder", Size: 4, Price: 3000},
{Name: "notebook", Size: 3, Price: 2000},
{Name: "iphone", Size: 1, Price: 2000},
},
totalSize: 4,
},
[][]int{
{1500, 1500, 1500, 1500},
{1500, 1500, 1500, 3000},
{1500, 1500, 2000, 3500},
{2000, 3500, 3500, 4000},
},
4000,
},
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
got := DynamicKnapsack(tt.args.elements, tt.args.totalSize)
assert.Equal(t, tt.want, got)
assert.Equal(t, tt.wantMaxPrice, got.lastValue())
})
}
}
func TestDynamicCommonSubstring(t *testing.T) {
type args struct {
first string
second string
}
tests := []struct {
name string
args args
want Table
wantSubstringLen int
}{
{
"fort fosh",
args{
first: "fort",
second: "fosh",
},
[][]int{
{1, 0, 0, 0},
{0, 2, 0, 0},
{0, 0, 0, 0},
{0, 0, 0, 0},
},
2,
},
{
"fish fosh",
args{
first: "fish",
second: "fosh",
},
[][]int{
{1, 0, 0, 0},
{0, 0, 0, 0},
{0, 0, 1, 0},
{0, 0, 0, 2},
},
2,
},
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
got := DynamicCommonSubstring(tt.args.first, tt.args.second)
assert.Equal(t, tt.want, got)
assert.Equal(t, tt.wantSubstringLen, got.maxValue())
})
}
}
func TestDynamicCommonSequence(t *testing.T) {
type args struct {
first string
second string
}
tests := []struct {
name string
args args
want Table
wantSequenceLen int
}{
{
"fort fosh",
args{
first: "fort",
second: "fosh",
},
[][]int{
{1, 1, 1, 1},
{1, 2, 2, 2},
{1, 2, 2, 2},
{1, 2, 2, 2},
},
2,
},
{
"fish fosh",
args{
first: "fish",
second: "fosh",
},
[][]int{
{1, 1, 1, 1},
{1, 1, 1, 1},
{1, 1, 2, 2},
{1, 1, 2, 3},
},
3,
},
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
got := DynamicCommonSequence(tt.args.first, tt.args.second)
assert.Equal(t, tt.want, got)
assert.Equal(t, tt.wantSequenceLen, got.lastValue())
})
}
}