Skip to content

[pull] master from labuladong:master #95

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

Merged

pull merged 1 commit into AlgorithmAndLeetCode:master from labuladong:master

Jun 1, 2023

+2 −0

Merged

[pull] master from labuladong:master #95

Changes from all commits

Commits

Show all changes

Select commit

labuladong May 31, 2023

File filter

Filter by extension

Conversations

Jump to

Jump to file

Failed to load files.

Loading

Diff view

Diff view

update content

Loading branch information

labuladong committed May 31, 2023

commit df7b1ed07fce546b53d0a373c176edea72c31321

2 changes: 2 additions & 0 deletions 动态规划系列/动态规划详解进阶.md

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
Expand Up		@@ -88,6 +88,8 @@ int fib(int N) {
		}
		```

	<visual slug='mydata-fib'/>

		这个不用多说了,学校老师讲递归的时候似乎都是拿这个举例。我们也知道这样写代码虽然简洁易懂,但是十分低效,低效在哪里?假设 n = 20,请画出递归树:

		![](https://labuladong.github.io/pictures/动态规划详解进阶/1.jpg)
Expand Down