Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

add notation of m and n in analysis of complexity #1621

Merged
merged 4 commits into from
Jan 21, 2025
Merged

add notation of m and n in analysis of complexity #1621

Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
45332c2
fix: notation of m and n in analysis of complexity
Urbaner3 Jan 20, 2025
fa19c86
Merge pull request #1 from Urbaner3/Urbaner3-patch-fix-notation
Urbaner3 Jan 20, 2025
7c36c67
Update dp_solution_pipeline.md
krahets Jan 21, 2025
9d31679
Update dp_solution_pipeline.md
krahets Jan 21, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion docs/chapter_dynamic_programming/dp_solution_pipeline.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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$ 分别为网格的行数和列数。请注意，这种计算方式未考虑临近网格边界的情况，当到达网络边界时只剩下一种选择，因此实际的路径数量会少一些。

### 方法二：记忆化搜索

Expand Down