From 18027ee26c8b95373954ff9643f413d5b0cdb1a2 Mon Sep 17 00:00:00 2001 From: "Peter Chen; Kohan Chen" <64827062+Urbaner3@users.noreply.github.com> Date: Tue, 21 Jan 2025 19:18:03 +0800 Subject: [PATCH] add notation of m and n in analysis of complexity (#1621) * fix: notation of m and n in analysis of complexity As title, complexity variable is not defined previously. * Update dp_solution_pipeline.md * Update dp_solution_pipeline.md --------- Co-authored-by: Yudong Jin --- docs/chapter_dynamic_programming/dp_solution_pipeline.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/chapter_dynamic_programming/dp_solution_pipeline.md b/docs/chapter_dynamic_programming/dp_solution_pipeline.md index 1d9c0b92c..068b58aba 100644 --- a/docs/chapter_dynamic_programming/dp_solution_pipeline.md +++ b/docs/chapter_dynamic_programming/dp_solution_pipeline.md @@ -110,7 +110,7 @@ $$ ![暴力搜索递归树](dp_solution_pipeline.assets/min_path_sum_dfs.png) -每个状态都有向下和向右两种选择，从左上角走到右下角总共需要 $m + n - 2$ 步，所以最差时间复杂度为 $O(2^{m + n})$ 。请注意，这种计算方式未考虑临近网格边界的情况，当到达网络边界时只剩下一种选择，因此实际的路径数量会少一些。 +每个状态都有向下和向右两种选择，从左上角走到右下角总共需要 $m + n - 2$ 步，所以最差时间复杂度为 $O(2^{m + n})$ ，其中 $n$ 和 $m$ 分别为网格的行数和列数。请注意，这种计算方式未考虑临近网格边界的情况，当到达网络边界时只剩下一种选择，因此实际的路径数量会少一些。 ### 方法二：记忆化搜索