From 1e7ce107613c578fdb99d3480e2e04e351434ac6 Mon Sep 17 00:00:00 2001
From: Haidong Ji
Date: Mon, 17 Dec 2018 21:18:43 -0600
Subject: Coin change Dynamic Programming done!

Easy implementation of the algorithm described in course slide. It
helped that I named variables according to the pseudo code. Getting
array indexing right is always a bit tricky so pay attention.---
 .../tests/CoinChangeDynamicProgrammingTest.java             | 13 +++++++++++++
 1 file changed, 13 insertions(+)
 create mode 100644 AlgoDesignAndTechniqueEdxJava/tests/CoinChangeDynamicProgrammingTest.java

(limited to 'AlgoDesignAndTechniqueEdxJava/tests/CoinChangeDynamicProgrammingTest.java')

diff --git a/AlgoDesignAndTechniqueEdxJava/tests/CoinChangeDynamicProgrammingTest.java b/AlgoDesignAndTechniqueEdxJava/tests/CoinChangeDynamicProgrammingTest.java
new file mode 100644
index 0000000..602e013
--- /dev/null
+++ b/AlgoDesignAndTechniqueEdxJava/tests/CoinChangeDynamicProgrammingTest.java
@@ -0,0 +1,13 @@
+import static org.junit.jupiter.api.Assertions.*;
+
+import org.junit.jupiter.api.Test;
+
+class CoinChangeDynamicProgrammingTest {
+
+    @Test
+    void test() {
+        assertEquals(2, CoinChangeDynamicProgramming.getChange(2));
+        assertEquals(9, CoinChangeDynamicProgramming.getChange(34));
+    }
+
+}
-- 
cgit v1.2.3