xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-13 15:56:05 +00:00
Code Issues Packages Projects Releases Wiki Activity

build

Browse Source
This commit is contained in:
krahets
2025-12-31 19:37:45 +08:00
parent 29ec0c699d
commit 3c9d5689c4
279 changed files with 40895 additions and 16087 deletions
Download Patch File Download Diff File Expand all files Collapse all files
en/docs/chapter_dynamic_programming/index.md
+10 -10
View File
@@ -3,22 +3,22 @@ comments: true
icon: material/table-pivot
---
# Chapter 14.   Dynamic programming
# Chapter 14.   Dynamic Programming
![Dynamic programming](../assets/covers/chapter_dynamic_programming.jpg){ class="cover-image" }
!!! abstract
Streams merge into rivers, and rivers merge into the sea.
Dynamic programming weaves smaller problems’ solutions into larger ones, guiding us step by step toward the far shore—where the ultimate answer awaits.
Streams converge into rivers, rivers converge into the sea.
Dynamic programming gathers solutions to small problems into answers to large problems, step by step guiding us to the shore of problem-solving.
## Chapter contents
- [14.1   Introduction to dynamic programming](intro_to_dynamic_programming.md)
- [14.2   Characteristics of DP problems](dp_problem_features.md)
- [14.3   DP problem-solving approach](dp_solution_pipeline.md)
- [14.4   0-1 Knapsack problem](knapsack_problem.md)
- [14.5   Unbounded knapsack problem](unbounded_knapsack_problem.md)
- [14.6   Edit distance problem](edit_distance_problem.md)
- [14.1   Introduction to Dynamic Programming](intro_to_dynamic_programming.md)
- [14.2   Characteristics of Dynamic Programming Problems](dp_problem_features.md)
- [14.3   Dynamic Programming Problem-Solving Approach](dp_solution_pipeline.md)
- [14.4   0-1 Knapsack Problem](knapsack_problem.md)
- [14.5   Unbounded Knapsack Problem](unbounded_knapsack_problem.md)
- [14.6   Edit Distance Problem](edit_distance_problem.md)
- [14.7   Summary](summary.md)