TreeviewCopyright © aleen42 all right reserved, powered by aleen42
Dynamic Programming(動態規劃) Back
- 當我們把分治的思想運用到優化問題上時, 我們稱之為動態規劃 (Dynamic Programming)
- 當一個問題符合最優子結構 (問題的最優解求解可以推給子問題的最優解, 且子問題最優解間互相獨立)時, 我們就可以通過動態規劃來解決問題
- 解決思路:
- characterize the structure of the optimal solution. (important)
- recursively define expressions.
- compute the value of the solution in a bottom-up fashion. (避免重複計算)
- construct the optimal solution using the computed information.
As the plugin is integrated with a code management system like GitLab or GitHub, you may have to auth with your account before leaving comments around this article.
Notice: This plugin has used Cookie to store your token with an expiration.