Dynamic planning summary

Recursive tree is           The time complexity is O（2 Of n Power ）

  Pruning operation （ Optimize ）     The time complexity is O（n）

Eliminate redundant computing

The actual is

Code implementation  

The optimization above , It's from F（20） To F(1) and F(0), Work out F(1) and F(0) In the backward calculation F（20）

There are two processes , Top down and bottom up ！

Optimize again , Eliminate top-down

  Only Bottom up

 

  Can be optimized again , Optimize space complexity

 

problem

  Violence law ：

  Optimize - Memorandum

 

  Optimize again

summary