Knapsack maximize gold done!

It was a bit tricky translating algo in course slide to code, especially
regarding array indexing. I left a bit and walked the dogs. After I came
back, my mind was clearer than before. Debugging after that solved the
problem!

1 files changed, 14 insertions, 0 deletions

diff --git a/AlgoDesignAndTechniqueEdxJava/tests/KnapsackTest.java b/AlgoDesignAndTechniqueEdxJava/tests/KnapsackTest.java
new file mode 100644
index 0000000..86624c7
--- /dev/null
+++ b/AlgoDesignAndTechniqueEdxJava/tests/KnapsackTest.java
@@ -0,0 +1,14 @@
+import static org.junit.jupiter.api.Assertions.*;
+
+import org.junit.jupiter.api.Test;
+
+class KnapsackTest {
+
+    @Test
+    void test() {
+        int[] w = { 1, 4, 8 };
+        int W = 10;
+        assertEquals(9, Knapsack.optimalWeight(W, w));
+    }
+
+}