From b12193500c0da24a9e7fc5a8523ed2252da88bad Mon Sep 17 00:00:00 2001
From: Haidong Ji
Date: Tue, 25 Dec 2018 14:27:29 -0600
Subject: Longest subsequence of 2 seqs done!

Not too bad, since I worked it out in Java already.---
 AlgoDesignAndTechniqueEdxPython/tests/lcs2Test.py | 48 +++++++++++++++++++++++
 1 file changed, 48 insertions(+)
 create mode 100644 AlgoDesignAndTechniqueEdxPython/tests/lcs2Test.py

(limited to 'AlgoDesignAndTechniqueEdxPython/tests')

diff --git a/AlgoDesignAndTechniqueEdxPython/tests/lcs2Test.py b/AlgoDesignAndTechniqueEdxPython/tests/lcs2Test.py
new file mode 100644
index 0000000..6c9d350
--- /dev/null
+++ b/AlgoDesignAndTechniqueEdxPython/tests/lcs2Test.py
@@ -0,0 +1,48 @@
+'''
+Created on Dec 25, 2018
+
+@author: haidong
+'''
+import unittest
+
+from sources.lcs2 import getLCS2Length
+
+
+class Test(unittest.TestCase):
+
+    def testName(self):
+        a = [2, 7, 5]
+        b = [2, 5]
+        self.assertEqual(2, getLCS2Length(a, b))
+
+    def testName1(self):
+        a = [7]
+        b = [1, 2, 3, 4]
+        self.assertEqual(0, getLCS2Length(a, b))
+
+    def testName2(self):
+        a = [2, 7, 8, 3]
+        b = [5, 2, 8, 7]
+        self.assertEqual(2, getLCS2Length(a, b))
+
+    def testName3(self):
+        a = [1, 2, 3, 4, 5, 6, 7]
+        b = [1, 2, 8, 4, 5, 6]
+        self.assertEqual(5, getLCS2Length(a, b))
+
+    def testName4(self):
+        a = [1, 9, 2, 5, 5, 5, 8, 3, 5, 11, 0, 2, 4, 1, 7, 4, 5, 9, 2, 4, 0, 3, 1, 5, 8, 3, 5, 9, 7, 8, 4, 5, 6,
+                7 ]
+        b = [6, 3, 8, 3, 1, 8, 3, 5, 0, 9, 6, 8, 3, 5, 7, 9, 1, 4, 7, 9, 3, 5, 9, 0, 1, 4, 2, 7, 5, 8, 9, 3, 5,
+                6, 1, 6, 3, 1, 6, 7, 3]
+        self.assertEqual(17, getLCS2Length(a, b))
+
+    def testName5(self):
+        a = [2, 4, 3, 3]
+        b = [1, 4, 3]
+        self.assertEqual(2, getLCS2Length(a, b))
+
+
+if __name__ == "__main__":
+    # import sys;sys.argv = ['', 'Test.testName']
+    unittest.main()
-- 
cgit v1.2.3