isLouisHsu / isLouisHsu/isLouisHsu.github.io
【算法】动态规划经典题型 | LOUIS' BLOG
Open
Nobody has claimed this yet.
f5071088de6d6b2354788646841da891
Gitalk
- Dominant language
- HTML
- Stars
- 4
- Forks
- 1
- PR merge metrics
- No merged PRs in 30d
Description
目录 目录 解题思路 零钱兑换 零钱兑换 I: 最少硬币个数 零钱兑换 II: 硬币组合数 背包问题II: 0-1背包 青蛙跳台阶问题 *青蛙过河问题 最小编辑距离 最大子序和问题 最长回文子串 最长递增子序列问题, LIS 最长公共子串 最长公共子序列问题, LCS *买卖股票的最佳时机 买卖股票的最佳时机 I: 一次交易 买卖股票的最佳时机 II: 无穷多次交易 买卖股票的最佳时机 III
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
Start by reviewing the linked dynamic-programming article and the issue context. The issue does not state what should change, so confirm the intended correction, addition, or update before editing the blog post; completion should be measured against that clarified request.
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