code for chapter 9 in ruby

2016-03-03 16:17:37 +01:00
parent 58b026e7b8
commit 7a2d6d8d77
1 changed files with 7 additions and 0 deletions
--- a/09_dynamic_programming/ruby/01_longest_common_subsequence.rb
+++ b/09_dynamic_programming/ruby/01_longest_common_subsequence.rb
@@ -0,0 +1,7 @@
+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] = [cell[i-1][j], cell[i][j-1]].max
+end