isLouisHsu / isLouisHsu/isLouisHsu.github.io
【算法】动态规划 | LOUIS' BLOG
Open
Nobody has claimed this yet.
653c4c659bb4abbca6ce7b30682c3309
Gitalk
- Dominant language
- HTML
- Stars
- 4
- Forks
- 1
- PR merge metrics
- No merged PRs in 30d
Description
动态规划和贪婪算法一样，对一个问题的解是一系列抉择的结果。在贪婪算法中已做出的抉择是不可更改的，而动态规划需考察一个最优抉择序列是否包含最优抉择子序列。称无论第一次选择是什么，接下来的选择一定是当前状态下的最优选择为最优原则(principal of optimality)。 用动态规划求解的步骤如下 证实最优原则适用，否则不能使用动态规划； 建立动态规划递归方程(dynamic-program
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Open the linked article and compare it with the issue body to determine whether this is a draft, correction, or publication request. The issue names no repository file, target section, or acceptance criteria, so clarify the intended content change and where it should appear before starting.
Written by the indexing model from the issue text.
Assessment
- Domain
- content
- Issue type
- Documentation
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 20/100