mirror of
https://github.com/krahets/hello-algo.git
synced 2026-11-10 16:00:36 +08:00
14c314c08c
* Retranslate the complete English edition from Simplified Chinese * Polish three English explanations after reader-focused review
56 lines
1.8 KiB
Python
56 lines
1.8 KiB
Python
"""
|
|
File: unbounded_knapsack.py
|
|
Created Time: 2023-07-10
|
|
Author: krahets (krahets@163.com)
|
|
"""
|
|
|
|
|
|
def unbounded_knapsack_dp(wgt: list[int], val: list[int], cap: int) -> int:
|
|
"""Unbounded knapsack: dynamic programming"""
|
|
n = len(wgt)
|
|
# Initialize the dp table
|
|
dp = [[0] * (cap + 1) for _ in range(n + 1)]
|
|
# State transitions
|
|
for i in range(1, n + 1):
|
|
for c in range(1, cap + 1):
|
|
if wgt[i - 1] > c:
|
|
# If item i exceeds the remaining capacity, do not choose it
|
|
dp[i][c] = dp[i - 1][c]
|
|
else:
|
|
# Take the larger value obtained by excluding and including item i
|
|
dp[i][c] = max(dp[i - 1][c], dp[i][c - wgt[i - 1]] + val[i - 1])
|
|
return dp[n][cap]
|
|
|
|
|
|
def unbounded_knapsack_dp_comp(wgt: list[int], val: list[int], cap: int) -> int:
|
|
"""Unbounded knapsack: space-optimized dynamic programming"""
|
|
n = len(wgt)
|
|
# Initialize the dp table
|
|
dp = [0] * (cap + 1)
|
|
# State transitions
|
|
for i in range(1, n + 1):
|
|
# Traverse in increasing order
|
|
for c in range(1, cap + 1):
|
|
if wgt[i - 1] > c:
|
|
# If item i exceeds the remaining capacity, do not choose it
|
|
dp[c] = dp[c]
|
|
else:
|
|
# Take the larger value obtained by excluding and including item i
|
|
dp[c] = max(dp[c], dp[c - wgt[i - 1]] + val[i - 1])
|
|
return dp[cap]
|
|
|
|
|
|
"""Driver code"""
|
|
if __name__ == "__main__":
|
|
wgt = [1, 2, 3]
|
|
val = [5, 11, 15]
|
|
cap = 4
|
|
|
|
# Dynamic programming
|
|
res = unbounded_knapsack_dp(wgt, val, cap)
|
|
print(f"Maximum total value within the knapsack capacity: {res}")
|
|
|
|
# Space-optimized dynamic programming
|
|
res = unbounded_knapsack_dp_comp(wgt, val, cap)
|
|
print(f"Maximum total value within the knapsack capacity: {res}")
|