code for chapter 9 in ruby

carpet92 · Mar 3, 2016 · 7a2d6d8 · 7a2d6d8
1 parent 58b026e
commit 7a2d6d8
Showing 1 changed file with 7 additions and 0 deletions.
diff --git 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