code for chapter 9

egonSchiele · egonSchiele · commit 2a01a0f5461a · 2016-03-02T15:11:32.000-08:00
diff --git a/09_dynamic_programming/python/01_longest_common_subsequence.py b/09_dynamic_programming/python/01_longest_common_subsequence.py
@@ -0,0 +1,6 @@
+if word_a[i] == word_b[j]:
+  # The letters match.
+  cell[i][j] = cell[i-1][j-1] + 1
+else:
+  # The letters don't match.
+  cell[i][j] = max(cell[i-1][j], cell[i][j-1])
