fork download
  1. def knapsack_01(values, weights, capacity):
  2. n = len(values)
  3. dp = [[0 for _ in range(capacity + 1)] for _ in range(n + 1)]
  4. for i in range(1, n + 1):
  5. for w in range(1, capacity + 1):
  6. if weights[i - 1] <= w:
  7. dp[i][w] = max(dp[i - 1][w], dp[i - 1][w - weights[i - 1]] + values[i - 1])
  8. else:
  9. dp[i][w] = dp[i - 1][w]
  10. return dp[n][capacity]
  11.  
  12.  
  13. # 测试数据
  14. values = [60, 100, 120]
  15. weights = [10, 20, 30]
  16. capacity = 50
  17. result = knapsack_01(values, weights, capacity)
  18. print(result)
  19.  
  20.  
Success #stdin #stdout 0.02s 9308KB
stdin
Standard input is empty
stdout
220