xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-08-27 18:37:13 +00:00
Code Issues Packages Projects Releases Wiki Activity

build

Browse Source
This commit is contained in:
krahets
2026-08-18 03:09:22 +08:00
parent d8c34d88b5
commit ba5285949b
108 changed files with 237 additions and 229 deletions
Download Patch File Download Diff File Expand all files Collapse all files
en/docs/chapter_dynamic_programming/edit_distance_problem.md
+1 -1
View File
@@ -43,7 +43,7 @@ In other words, each round of decision (edit operation) we make on string $s$ wi
State $[i, j]$ corresponds to the subproblem: **the minimum number of edits required to change the first $i$ characters of $s$ into the first $j$ characters of $t$**.
From this, we obtain a two-dimensional $dp$ table of size $(i+1) \times (j+1)$.
From this, we obtain a two-dimensional $dp$ table of size $(n+1) \times (m+1)$.
**Step 2: Identify the optimal substructure, and then derive the state transition equation**