{"id":20295115,"url":"https://github.com/agnjason/0-1-knapsack-problem","last_synced_at":"2026-04-21T10:04:34.521Z","repository":{"id":211544986,"uuid":"236890154","full_name":"agnJason/0-1-knapsack-problem","owner":"agnJason","description":"0/1背包问题 动态规划问题","archived":false,"fork":false,"pushed_at":"2020-01-29T02:49:08.000Z","size":4,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-04T05:31:51.923Z","etag":null,"topics":["dynamic-programming","python"],"latest_commit_sha":null,"homepage":null,"language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/agnJason.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2020-01-29T02:45:27.000Z","updated_at":"2020-06-23T01:43:04.000Z","dependencies_parsed_at":null,"dependency_job_id":"1e39689e-2c6e-48cd-99a5-c16b2f28c71d","html_url":"https://github.com/agnJason/0-1-knapsack-problem","commit_stats":null,"previous_names":["agnjason/0-1-knapsack-problem"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/agnJason/0-1-knapsack-problem","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/agnJason%2F0-1-knapsack-problem","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/agnJason%2F0-1-knapsack-problem/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/agnJason%2F0-1-knapsack-problem/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/agnJason%2F0-1-knapsack-problem/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/agnJason","download_url":"https://codeload.github.com/agnJason/0-1-knapsack-problem/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/agnJason%2F0-1-knapsack-problem/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279033061,"owners_count":26089392,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-10-14T02:00:06.444Z","response_time":60,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["dynamic-programming","python"],"created_at":"2024-11-14T15:33:13.350Z","updated_at":"2025-10-15T01:36:01.004Z","avatar_url":"https://github.com/agnJason.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# 0-1-knapsack-problem\n0-1背包问题和部分背包问题的求解\n一、简介\n背包问题是一个很经典而且讨论很广泛的算法问题了，0-1背包问题和部分背包问题解决方法背后其实隐藏了两种比较常见的算法解决思路，动态规划和贪婪算法。\n二、问题描述\n假设我们有n件物品，分别编号为1, 2...n。其中编号为i的物品价值为vi，它的重量为wi。为了简化问题，假定价值和重量都是整数值。现在，假设我们有一个背包，它能够承载的重量是W。现在，我们希望往包里装这些物品，使得包里装的物品价值最大化，那么我们该如何来选择装的东西呢？这个问题其实根据不同的情况可以归结为不同的解决方法。假定我们这里选取的物品每个都是独立的，不能选取部分。也就是说我们要么选取某个物品，要么不能选取，不能只选取一个物品的一部分。这种情况，我们称之为0-1背包问题。而如果我们可以使用部分的物品的话，这个问题则成为部分背包(fractional knapsack)问题。\n三、数据与问题\n有5个物品，其重量分别是{2, 2, 6, 5, 4}，价值分别为{6, 3, 5, 4, 6}，背包的容量为10，求装入背包的物品和获得的最大价值。\n请用0-1背包的动态规划和部分背包的贪婪算法分别处理上述问题。\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fagnjason%2F0-1-knapsack-problem","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fagnjason%2F0-1-knapsack-problem","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fagnjason%2F0-1-knapsack-problem/lists"}