编辑“︁0-1背包问题”︁（章节）

=== 代码实现 ===  
以下是Python实现示例：  
<syntaxhighlight lang="python">  
def knapsack_01(weights, values, W):  
    n = len(weights)  
    dp = [[0] * (W + 1) for _ in range(n + 1)]  
    for i in range(1, n + 1):  
        for j in range(1, W + 1):  
            if weights[i-1] <= j:  
                dp[i][j] = max(dp[i-1][j], dp[i-1][j-weights[i-1]] + values[i-1])  
            else:  
                dp[i][j] = dp[i-1][j]  
    return dp[n][W]  

# 示例输入  
weights = [2, 3, 4, 5]  
values = [3, 4, 5, 6]  
W = 5  
print(knapsack_01(weights, values, W))  # 输出：7（选择物品0和1）  
</syntaxhighlight>