Modified longest_common_ssubsequence.py for successful doctests (#1332)

TheAlgorithms · Oct 11, 2019 · 67291a5bce1f5761ce2d6978193ec4a3b1f6dcc6 · 67291a5
1 parent e678879
commit 67291a5bce1f5761ce2d6978193ec4a3b1f6dcc6
Unified Split

Showing with 4 additions and 3 deletions.

+4 −3 dynamic_programming/longest_common_subsequence.py
diff --git a/dynamic_programming/longest_common_subsequence.py b/dynamic_programming/longest_common_subsequence.py
@@ -76,6 +76,7 @@ def longest_common_subsequence(x: str, y: str):
     expected_subseq = "GTAB"
 
     ln, subseq = longest_common_subsequence(a, b)
-    assert expected_ln == ln
-    assert expected_subseq == subseq
-    print("len =", ln, ", sub-sequence =", subseq)
+##    print("len =", ln, ", sub-sequence =", subseq)
+    import doctest
+
+    doctest.testmod()