added Unbounded Knapsack

Author: minhyeong-joe

DynamicProgramming/UnboundedKnapsack/README.md

@@ -0,0 +1,19 @@
+# Unbounded Knapsack
+
+## Problem:
+
+Given `weights`: list of weights where `weights[i]` represents the weight of `i-th` item,
+`values` : list of values where `values[i]` represents the value of `i-th` item,
+and `capacity`, total capacity available,
+Find the maximum values that can be achieved within the limit of total weight.
+
+**same items can be used multiple times**
+
+## Example:
+
+```
+weights = [1,2,3,5]
+values =  [1,4,7,10]
+capacity = 8
+Output: 18
+```

DynamicProgramming/UnboundedKnapsack/solution.py

@@ -0,0 +1,16 @@
+def unboundedKnapsack(weights, values, capacity):
+    dp = [[0 for _ in range(capacity+1)] for _ in range(len(weights)+1)]
+    for i in range(1, len(dp)):
+        for j in range(1, len(dp[i])):
+            if weights[i-1] <= j:
+                dp[i][j] = max(dp[i-1][j], dp[i][j-weights[i-1]]+values[i-1])
+            else:
+                dp[i][j] = dp[i-1][j]
+    # print(dp)
+    return dp[-1][-1]
+
+
+weights = [1, 2, 3, 5]
+values = [1, 4, 7, 10]
+capacity = 8
+print(unboundedKnapsack(weights, values, capacity))

README.md

@@ -68,7 +68,9 @@ Languages used: Java and Python
 - [Predict Winner](DynamicProgramming/PredictWinner)
 - [Reducing Dishes](DynamicProgramming/ReducingDishes)
 - [Regex Matching](DynamicProgramming/RegexMatching)
+- [Unbounded Knapsack](DynamicProgramming/UnboundedKnapsack)
 - [Unique Paths](DynamicProgramming/UniquePaths)
+- [0-1 Knapsack](DynamicProgramming/ZeroOneKnapsack)
 
 ### [Graph](./Graph)