Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

【算法】动态规划 | LOUIS' BLOG #74

Open
isLouisHsu opened this issue Jun 21, 2020 · 0 comments
Open

【算法】动态规划 | LOUIS' BLOG #74

isLouisHsu opened this issue Jun 21, 2020 · 0 comments
Labels
653c4c659bb4abbca6ce7b30682c3309 Gitalk

Comments

@isLouisHsu
Copy link
Owner

https://louishsu.xyz/2020/03/21/%E3%80%90%E7%AE%97%E6%B3%95%E3%80%91%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92/

动态规划和贪婪算法一样，对一个问题的解是一系列抉择的结果。在贪婪算法中已做出的抉择是不可更改的，而动态规划需考察一个最优抉择序列是否包含最优抉择子序列。称无论第一次选择是什么，接下来的选择一定是当前状态下的最优选择为最优原则(principal of optimality)。 用动态规划求解的步骤如下 证实最优原则适用，否则不能使用动态规划； 建立动态规划递归方程(dynamic-program
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
653c4c659bb4abbca6ce7b30682c3309 Gitalk
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@isLouisHsu