[dynamic planning] beginner level

Exhaustive method / Violent search

Memory search / prune

The calculated ones are saved , If you encounter the same problem, it will not be calculated

It is often said that dynamic planning is to trade space for time , That's why .
Also called memo recursion or recursive tree pruning .

Rewrite to iterative form

Suppose we find the optimal solution of the top of the recursive stack at the beginning , Then the calculation process is from back to front , All the way to the bottom of the recursive stack is the result we need .