-
Notifications
You must be signed in to change notification settings - Fork 5
Expand file tree
/
Copy pathDPTest.cs
More file actions
426 lines (343 loc) · 9.15 KB
/
DPTest.cs
File metadata and controls
426 lines (343 loc) · 9.15 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
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
using algorithm_pattern.basic_algorithm.DP;
namespace UnitTest.basic_algorithm;
public class DPTest
{
List<IList<int>> triangle;
[SetUp]
public void Setup()
{
triangle = new List<IList<int>> { new List<int> { 2 }, new List<int> { 3, 4 }, new List<int> { 6, 5, 7 }, new List<int> { 4, 1, 8, 3 } };
}
#region 120. 三角形最小路径和
[Test]
public void MinimumTotalTest()
{
var result = DP.MinimumTotal(triangle);
Assert.That(result, Is.EqualTo(11));
}
[Test]
public void MinimumTotalTest2()
{
var result = DP.MinimumTotal2(triangle);
Assert.That(result, Is.EqualTo(11));
}
[Test]
public void MinimumTotalTest_DownToUp()
{
var result = DP.MinimumTotal_DownToUp(triangle);
Assert.That(result, Is.EqualTo(11));
}
[Test]
public void MinimumTotalTest_TopToDown()
{
var result = DP.MinimumTotal_TopToDown(triangle);
Assert.That(result, Is.EqualTo(11));
}
[Test]
public void MinimumTotalTest_Final()
{
var result = DP.MinimumTotal_Final(triangle);
Assert.That(result, Is.EqualTo(11));
}
#endregion
#region 64. 最小路径和
[Test]
public void MinPathSumTest()
{
var grid = new int[][]
{
new int[] { 1, 3, 1 },
new int[] { 1, 5, 1 },
new int[] { 4, 2, 1 }
};
var result = DP.MinPathSum(grid);
Assert.That(result, Is.EqualTo(7));
}
[Test]
public void MinPathSumTest_2()
{
var grid = new int[][]
{
new int[] { 1, 2, 3 },
new int[] { 4, 5, 6 },
};
var result = DP.MinPathSum(grid);
Assert.That(result, Is.EqualTo(12));
}
#endregion
#region 62. 不同路径
[Test]
public void UniquePathsTest()
{
var result = DP.UniquePaths(3, 7);
Assert.That(result, Is.EqualTo(28));
}
[Test]
public void UniquePathsTest_2()
{
var result = DP.UniquePaths(3, 2);
Assert.That(result, Is.EqualTo(3));
}
#endregion
#region 63. 不同路径 II
[Test]
public void UniquePathsWithObstaclesTest()
{
var obstacleGrid = new int[][]
{
new int[] { 0, 0, 0 },
new int[] { 0, 1, 0 },
new int[] { 0, 0, 0 }
};
var result = DP.UniquePathsWithObstacles(obstacleGrid);
Assert.That(result, Is.EqualTo(2));
}
[Test]
public void UniquePathsWithObstaclesTest_2()
{
var obstacleGrid = new int[][]
{
new int[] { 0, 1 },
new int[] { 0, 0 }
};
var result = DP.UniquePathsWithObstacles(obstacleGrid);
Assert.That(result, Is.EqualTo(1));
}
#endregion
#region 70. 爬楼梯
[Test]
public void ClimbStairsTest()
{
var result = DP.ClimbStairs(4);
Assert.That(result, Is.EqualTo(5));
}
[Test]
public void ClimbStairsTest_2()
{
var result = DP.ClimbStairs(2);
Assert.That(result, Is.EqualTo(2));
}
[Test]
public void ClimbStairsTest_3()
{
var result = DP.ClimbStairs(3);
Assert.That(result, Is.EqualTo(3));
}
#endregion
#region 55. 跳跃游戏
[Test]
public void CanJumpTest()
{
var result = DP.CanJump(new int[] { 2, 3, 1, 1, 4 });
Assert.That(result, Is.EqualTo(true));
}
[Test]
public void CanJumpTest_2()
{
var result = DP.CanJump(new int[] { 3, 2, 1, 0, 4 });
Assert.That(result, Is.EqualTo(false));
}
#endregion
#region 45. 跳跃游戏 ii
[Test]
public void JumpTest()
{
var result = DP.Jump(new int[] { 2, 3, 1, 1, 4 });
Assert.That(result, Is.EqualTo(2));
}
[Test]
public void JumpTest_2()
{
var result = DP.Jump(new int[] { 2, 3, 0, 1, 4 });
Assert.That(result, Is.EqualTo(2));
}
[Test]
public void JumpTest_Greedy()
{
var result = DP.Jump_Greedy(new int[] { 2, 3, 1, 1, 4 });
Assert.That(result, Is.EqualTo(2));
}
[Test]
public void JumpTest_Greedy_2()
{
var result = DP.Jump_Greedy(new int[] { 2, 3, 0, 1, 4 });
Assert.That(result, Is.EqualTo(2));
}
#endregion
#region 132. 分割回文串 ii
[Test]
public void MinCutTest()
{
var result = DP.MinCut("aab");
Assert.That(result, Is.EqualTo(1));
}
[Test]
public void MinCutTest_2()
{
var result = DP.MinCut("a");
Assert.That(result, Is.EqualTo(0));
}
[Test]
public void MinCutTest_3()
{
var result = DP.MinCut("ab");
Assert.That(result, Is.EqualTo(1));
}
#endregion
#region 300. 最长递增子序列
[Test]
public void LengthOfLISTest()
{
var result = DP.LengthOfLIS(new int[] { 10, 9, 2, 5, 3, 7, 101, 18 });
Assert.That(result, Is.EqualTo(4));
}
[Test]
public void LengthOfLISTest_2()
{
var result = DP.LengthOfLIS(new int[] { 0, 1, 0, 3, 2, 3 });
Assert.That(result, Is.EqualTo(4));
}
[Test]
public void LengthOfLISTest_3()
{
var result = DP.LengthOfLIS(new int[] { 7, 7, 7, 7, 7, 7, 7 });
Assert.That(result, Is.EqualTo(1));
}
#endregion
#region 139. 单词拆分
[Test]
public void WordBreakTest()
{
var result = DP.WordBreak("leetcode", new List<string> { "leet", "code" });
Assert.That(result, Is.EqualTo(true));
}
[Test]
public void WordBreakTest_2()
{
var result = DP.WordBreak("applepenapple", new List<string> { "apple", "pen" });
Assert.That(result, Is.EqualTo(true));
}
[Test]
public void WordBreakTest_3()
{
var result = DP.WordBreak("catsandog", new List<string> { "cats", "dog", "sand", "and", "cat" });
Assert.That(result, Is.EqualTo(false));
}
#endregion
#region 1143. 最长公共子序列
[Test]
public void LongestCommonSubsequenceTest()
{
var result = DP.LongestCommonSubsequence("abcde", "ace");
Assert.That(result, Is.EqualTo(3));
}
[Test]
public void LongestCommonSubsequenceTest_2()
{
var result = DP.LongestCommonSubsequence("abc", "abc");
Assert.That(result, Is.EqualTo(3));
}
[Test]
public void LongestCommonSubsequenceTest_3()
{
var result = DP.LongestCommonSubsequence("abc", "def");
Assert.That(result, Is.EqualTo(0));
}
#endregion
#region 72. 编辑距离
[Test]
public void MinDistanceTest()
{
var result = DP.MinDistance("horse", "ros");
Assert.That(result, Is.EqualTo(3));
}
[Test]
public void MinDistanceTest_2()
{
var result = DP.MinDistance("intention", "execution");
Assert.That(result, Is.EqualTo(5));
}
#endregion
#region 322. 零钱兑换
[Test]
public void CoinChangeTest()
{
var result = DP.CoinChange(new[] { 1, 2, 5 }, 11);
Assert.That(result, Is.EqualTo(3));
}
[Test]
public void CoinChangeTest_2()
{
var result = DP.CoinChange(new[] { 2 }, 3);
Assert.That(result, Is.EqualTo(-1));
}
[Test]
public void CoinChangeTest_3()
{
var result = DP.CoinChange(new[] { 1 }, 0);
Assert.That(result, Is.EqualTo(0));
}
#endregion
#region 518. 零钱兑换 ii
[Test]
public void ChangeTest()
{
var result = DP.Change(5, new[] { 1, 2, 5 });
Assert.That(result, Is.EqualTo(4));
}
[Test]
public void ChangeTest_2()
{
var result = DP.Change(3, new[] { 2 });
Assert.That(result, Is.EqualTo(0));
}
[Test]
public void ChangeTest_3()
{
var result = DP.Change(10, new[] { 10 });
Assert.That(result, Is.EqualTo(1));
}
#endregion
#region 92.背包问题
[Test]
public void BackPackTest()
{
var result = DP.BackPack(10, new[] { 3, 4, 8, 5 });
Assert.That(result, Is.EqualTo(9));
}
[Test]
public void BackPackTest_2()
{
var result = DP.BackPack(12, new[] { 2, 3, 5, 7 });
Assert.That(result, Is.EqualTo(12));
}
#endregion
#region 125.背包问题 ii
[Test]
public void BackPackIITest()
{
var result = DP.BackPackII(10, new[] { 2, 3, 5, 7 }, new[] { 1, 5, 2, 4 });
Assert.That(result, Is.EqualTo(9));
}
[Test]
public void BackPackIITest_2()
{
var result = DP.BackPackII(10, new[] { 2, 3, 8 }, new[] { 2, 5, 8 });
Assert.That(result, Is.EqualTo(10));
}
#endregion
#region 416. 分割等和子集
[Test]
public void CanPartitionTest()
{
var result = DP.CanPartition(new[] { 1, 5, 11, 5 });
Assert.That(result, Is.EqualTo(true));
}
[Test]
public void CanPartitionTest_2()
{
var result = DP.CanPartition(new[] { 1, 2, 3, 5 });
Assert.That(result, Is.EqualTo(false));
}
#endregion
}