擅长:python、mysql、java
<p>以上并不是严格意义上的动态规划。在DP中有一个表,代码不可能达到Python中的递归深度限制。在</p>
<pre><code>def unboundedKnapsack(W, n, val, wt):
dp = [0 for i in range(W + 1)]
ans = 0
for i in range(W + 1):
for j in range(n):
if (wt[j] <= i):
dp[i] = max(dp[i], dp[i - wt[j]] + val[j])
return dp[W]
W = 60
val = [ 1, 20]
wt = [1, 30]
n = len(val)
print(unboundedKnapsack(W, n, val, wt))
</code></pre>