I can't come up with a more optimized version of the following code for a bounded 0-1 knapsack algorithm. Anyone here wanna take a stab at it?
[code:lit]
if(dp[i-1][j] >= 0):
dp[j] = 0
elif(dp[j - c] >= 0 and dp[j - c] < s):
dp[j] = dp[j - c] + 1
else:
dp[j] = -1
[/code:lit]
[code:lit]
if(dp[i-1][j] >= 0):
dp[j] = 0
elif(dp[j - c] >= 0 and dp[j - c] < s):
dp[j] = dp[j - c] + 1
else:
dp[j] = -1
[/code:lit]
