algorithm/fucking-algorithm
1
0
Fork 0
mirror of https://github.com/labuladong/fucking-algorithm.git synced 2025-07-05 03:36:39 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fixed english translation

Browse Source 
Fixed english translation
This commit is contained in:
BruceCat
2021-03-09 19:30:36 +08:00
committed by GitHub
parent 73d040f386 286754bdc5
commit 007d26fdfa
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
think_like_computer/Framework and thoughts about learning data structure and algorithm.md
View File

@ -192,7 +192,7 @@ For a person who understands binary trees, it won't take long to do exercises of
More examples:
[Dynamic programming](../动态规划系列/动态规划详解进阶.md) said that the problem of collecting changes, the violent solution is to traverse an n-tree:
[Dynamic programming](../动态规划系列/动态规划详解进阶.md) said that the problem of collecting changes, the brute-force solution is to traverse an n-tree:
![](../pictures/动态规划详解进阶/5.jpg)
@ -267,4 +267,4 @@ This kind of thinking is very important. Sometimes I write the solution accordin
The basic storage mode of data structure is chain and order. The basic operation is to add, delete, search and modify. The traversal mode is nothing but iteration and recursion.
It is suggested to start from "tree" and finish these dozens of questions in combination with frame thinking. The understanding of tree structure should be in place. At this time, if you look at the topics of backtracking, dynamic rules, divide and conquer, you may have a deeper understanding of the ideas.
It is suggested to start from "tree" and finish these dozens of questions in combination with frame thinking. The understanding of tree structure should be in place. At this time, if you look at the topics of backtracking, dynamic rules, divide and conquer, you may have a deeper understanding of the ideas.