|
8 | 8 |
|
9 | 9 | ## 本章内容
|
10 | 10 |
|
11 | | -- [8.1 动态规划基础](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_01_dynamic_programming_basic.md) |
12 | | -- [8.2 记忆化搜索](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_02_memoization_search.md) |
13 | | -- [8.3 线性 DP(一):单串线性 DP](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_03_linear_dp_01.md) |
14 | | -- [8.4 线性 DP(二):双串线性 DP](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_04_linear_dp_02.md) |
15 | | -- [8.5 线性 DP(三):矩阵线性 DP、无串线性 DP](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_05_linear_dp_02.md) |
16 | | -- [8.6 背包问题知识(一):0-1 背包](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_06_knapsack_problem_01.md) |
17 | | -- [8.7 背包问题知识(二):完全背包](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_07_knapsack_problem_02.md) |
18 | | -- [8.8 背包问题知识(三):多重背包](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_08_knapsack_problem_03.md) |
19 | | -- [8.9 背包问题知识(四):混合背包、分组背包](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_09_knapsack_problem_04.md) |
20 | | -- [8.10 背包问题知识(五):背包问题变种](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_10_knapsack_problem_05.md) |
21 | | -- [8.11 区间 DP](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_11_interval_dp.md) |
22 | | -- [8.12 树形 DP](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_12_tree_dp.md) |
23 | | -- [8.13 状态压缩 DP](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_13_state_compression_dp.md) |
24 | | -- [8.14 计数 DP](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_14_counting_dp.md) |
25 | | -- [8.15 数位 DP](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_15_digit_dp.md) |
26 | | -- [8.16 概率 DP](https://github.com/itcharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_16_probability_dp.md) |
| 11 | +- [8.1 动态规划基础](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_01_dynamic_programming_basic.md) |
| 12 | +- [8.2 记忆化搜索](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_02_memoization_search.md) |
| 13 | +- [8.3 线性 DP(一):单串线性 DP](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_03_linear_dp_01.md) |
| 14 | +- [8.4 线性 DP(二):双串线性 DP](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_04_linear_dp_02.md) |
| 15 | +- [8.5 线性 DP(三):矩阵线性 DP、无串线性 DP](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_05_linear_dp_02.md) |
| 16 | +- [8.6 背包问题知识(一):0-1 背包](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_06_knapsack_problem_01.md) |
| 17 | +- [8.7 背包问题知识(二):完全背包](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_07_knapsack_problem_02.md) |
| 18 | +- [8.8 背包问题知识(三):多重背包](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_08_knapsack_problem_03.md) |
| 19 | +- [8.9 背包问题知识(四):混合背包、分组背包](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_09_knapsack_problem_04.md) |
| 20 | +- [8.10 背包问题知识(五):背包问题变种](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_10_knapsack_problem_05.md) |
| 21 | +- [8.11 区间 DP](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_11_interval_dp.md) |
| 22 | +- [8.12 树形 DP](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_12_tree_dp.md) |
| 23 | +- [8.13 状态压缩 DP](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_13_state_compression_dp.md) |
| 24 | +- [8.14 计数 DP](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_14_counting_dp.md) |
| 25 | +- [8.15 数位 DP](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_15_digit_dp.md) |
| 26 | +- [8.16 概率 DP](https://github.com/ITCharge/AlgoNote/tree/main/docs/08_dynamic_programming/08_16_probability_dp.md) |
0 commit comments