isLouisHsu / isLouisHsu/isLouisHsu.github.io
【算法】背包问题 | LOUIS' BLOG
Open
Nobody has claimed this yet.
4255b0e7012bc8d6683c62aaed2bbe14
Gitalk
- Dominant language
- HTML
- Stars
- 4
- Forks
- 1
- PR merge metrics
- No merged PRs in 30d
Description
目录背包问题是动态规划的经典问题，它的意义在于可运用到其他问题上，其基本描述为：给定容量为$W$的背包，以及$N$件物品，第$i$件物品的价值是$p_i$、所需容量为$w_i$，在不同的限制条件下，求能放进背包的物品最大价值总和是多少？根据限制条件不同，如物品数目可产生变种的背包问题。 目录 0-1背包 完全背包 多重背包 混合三种背包 二维费用背包 分组背包 有依赖背包 泛化物品背包 背包问题
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 with the linked LOUIS' BLOG article and the issue text, which describe several knapsack-problem variants. The issue does not identify a requested change, target file, test, or completion criteria, so clarify the intended documentation work before estimating or implementing it.
Written by the indexing model from the issue text.
Assessment
- Domain
- content, documentation
- Issue type
- Documentation
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100