Skip to content
START WITH A QUESTION

What would you like to understand?

Find an answer. See the moment it becomes clear. Follow the idea further.

← Concept directory

Answers for “阶乘示例如何说明动态规划的核心机制?”

3 keyword matches

Understanding your question. You can explore the search results below now.

Meet the concept

↗

Optimal substructure means that the optimal solution to the overall problem can be constructed by efficiently combining the optimal solutions of its subproblems. In the route example, once the shortest SF→LA and LA→SD segments are known, they combine to give the shortest SF→SD route.

Conditions: The problem can be divided into subproblems.; The optimal solution of the main problem depends on the optimal solutions of its subproblems.

Meet the concept

↗

A problem is a dynamic programming problem if it satisfies two conditions: optimal substructure and overlapping subproblems. Optimal substructure means the optimal solution to the overall problem can be constructed from the optimal solutions of its subproblems.

Conditions: The problem can be solved using an algorithmic approach.; The problem can be divided into subproblems.

Meet the concept

↗

Richard Bellman used the term 'programming' to signify planning and decision making, not writing computer code. The term 'dynamic' refers to the ever-changing nature of the problems being solved.

Conditions: The context is the historical origin of the term 'dynamic programming'.