Data commit

Task/Longest-common-subsequence/Python/longest-common-subsequence-1.py

@@ -0,0 +1,12 @@
+def lcs(xstr, ystr):
+    """
+    >>> lcs('thisisatest', 'testing123testing')
+    'tsitest'
+    """
+    if not xstr or not ystr:
+        return ""
+    x, xs, y, ys = xstr[0], xstr[1:], ystr[0], ystr[1:]
+    if x == y:
+        return str(lcs(xs, ys)) + x
+    else:
+        return max(lcs(xstr, ys), lcs(xs, ystr), key=len)

Task/Longest-common-subsequence/Python/longest-common-subsequence-2.py

@@ -0,0 +1,2 @@
+if __name__=="__main__":
+    import doctest; doctest.testmod()

Task/Longest-common-subsequence/Python/longest-common-subsequence-3.py

@@ -0,0 +1,18 @@
+def lcs(a, b):
+    # generate matrix of length of longest common subsequence for substrings of both words
+    lengths = [[0] * (len(b)+1) for _ in range(len(a)+1)]
+    for i, x in enumerate(a):
+        for j, y in enumerate(b):
+            if x == y:
+                lengths[i+1][j+1] = lengths[i][j] + 1
+            else:
+                lengths[i+1][j+1] = max(lengths[i+1][j], lengths[i][j+1])
+
+    # read a substring from the matrix
+    result = ''
+    j = len(b)
+    for i in range(1, len(a)+1):
+        if lengths[i][j] != lengths[i-1][j]:
+            result += a[i-1]
+
+    return result