List of articles

• Preface
• Dynamic programming routines
• BM62 Fibonacci sequence
• • 1. Recursive violence solving
  • 2. Recursive solution of subproblem optimization
• Time consuming comparison

Preface

《 Huawei machine test real problem 》 The column includes Huawei column of niuke.com 、 Huawei test questions 、 Huawei OD Real problem of machine test .

If you are preparing for Huawei's interview , If you want to know something, you can send me a private letter , I will try my best to help you , I can also give you some suggestions ！

This paper solves the non optimal solution （ Non optimal performance ）.

Dynamic programming routines

Dynamic programming （Dynamic Programming,DP） It's a branch of operations research , It is the process of solving the optimization of decision-making process .

There are many problems in dynamic planning , such as ： The longest increasing subsequence problem 、 Shortest path problem 、 knapsack problem 、 Resource allocation, etc .

Dynamic planning is not everything , Problems applicable to dynamic programming must meet Optimal substructure and No aftereffect .

• Optimal substructure ： The dynamic programming problem must have the optimal substructure , From the best value of the subproblem to the best value of the original problem .
• No aftereffect ： After arranging the stages in a certain order , For a given state , The state of its previous stages cannot directly affect its future decisions , And only through the current state ࿰