algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-19 07:17:54 +08:00
Code Issues Packages Projects Releases Wiki Activity

Bug fixes and improvements (#1078)

Browse Source 
* Fix the logo in the en version

* Optimize header color and fix body background color

* Update theme switch's name

* Fix backfrop-filter on Safari

* Update some animation's file name for adding egde when cropping

* Re-count the comments number

* A bug fix in n_queens_problem.md
This commit is contained in:
Yudong Jin
2024-02-14 18:37:18 +08:00
committed by GitHub
parent 5f82a86bd6
commit e813b5a0fa
49 changed files with 94 additions and 58 deletions
Download Patch File Download Diff File Expand all files Collapse all files

0
docs/chapter_dynamic_programming/dp_solution_pipeline.assets/min_path_sum_solution_step3.png → docs/chapter_dynamic_programming/dp_solution_pipeline.assets/min_path_sum_solution_initial_state.png
View File

Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 21 KiB

After

Width:  |  Height:  |  Size: 21 KiB

0
docs/chapter_dynamic_programming/dp_solution_pipeline.assets/min_path_sum_solution_step1.png → docs/chapter_dynamic_programming/dp_solution_pipeline.assets/min_path_sum_solution_state_definition.png
View File

Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 22 KiB

After

Width:  |  Height:  |  Size: 22 KiB

0
docs/chapter_dynamic_programming/dp_solution_pipeline.assets/min_path_sum_solution_step2.png → docs/chapter_dynamic_programming/dp_solution_pipeline.assets/min_path_sum_solution_state_transition.png
View File

Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 18 KiB

After

Width:  |  Height:  |  Size: 18 KiB

6
docs/chapter_dynamic_programming/dp_solution_pipeline.md
View File

@@ -47,7 +47,7 @@
至此，我们就得到了下图所示的二维 $dp$ 矩阵，其尺寸与输入网格 $grid$ 相同。
![状态定义与 dp 表](dp_solution_pipeline.assets/min_path_sum_solution_step1.png)
![状态定义与 dp 表](dp_solution_pipeline.assets/min_path_sum_solution_state_definition.png)
!!! note
@@ -65,7 +65,7 @@ $$
dp[i, j] = \min(dp[i-1, j], dp[i, j-1]) + grid[i, j]
$$
![最优子结构与状态转移方程](dp_solution_pipeline.assets/min_path_sum_solution_step2.png)
![最优子结构与状态转移方程](dp_solution_pipeline.assets/min_path_sum_solution_state_transition.png)
!!! note
@@ -79,7 +79,7 @@ $$
如下图所示，由于每个格子是由其左方格子和上方格子转移而来，因此我们使用循环来遍历矩阵，外循环遍历各行，内循环遍历各列。
![边界条件与状态转移顺序](dp_solution_pipeline.assets/min_path_sum_solution_step3.png)
![边界条件与状态转移顺序](dp_solution_pipeline.assets/min_path_sum_solution_initial_state.png)
!!! note