From 11a2de7473807093fe4c4a1b5b256a399734ba8a Mon Sep 17 00:00:00 2001 From: spainn <148598154+spainn@users.noreply.github.com> Date: Fri, 22 Mar 2024 15:03:28 -0500 Subject: [PATCH] Update 01_longest_common_subsequence.py (#277) The original code was creating a 4x5 grid instead of 5x4. I also made it display by row. Co-authored-by: WhileRested <148598154+WhileRested@users.noreply.github.com> --- .../python/01_longest_common_subsequence.py | 12 +++++++----- 1 file changed, 7 insertions(+), 5 deletions(-) diff --git a/11_dynamic_programming/python/01_longest_common_subsequence.py b/11_dynamic_programming/python/01_longest_common_subsequence.py index 61691a0..315b233 100644 --- a/11_dynamic_programming/python/01_longest_common_subsequence.py +++ b/11_dynamic_programming/python/01_longest_common_subsequence.py @@ -1,13 +1,15 @@ dp_table_blue = ["b", "l", "u", "e"] dp_table_clues = ["c", "l", "u", "e", "s"] -dp_table = [[0 for i in range(len(dp_table_blue))] for i in range(len(dp_table_clues))] # (5,4) -print(dp_table) +dp_table = [[0 for i in range(len(dp_table_clues))] for i in range(len(dp_table_blue))] # (5,4) +# for each row for i in range(0, len(dp_table_blue)): + # for each column for j in range(0, len(dp_table_clues)): if dp_table_clues[j] == dp_table_blue[i]: - dp_table[j][i] = dp_table[j-1][i-1] + 1 + dp_table[i][j] = dp_table[i-1][j-1] + 1 else: - dp_table[j][i] = max(dp_table[j-1][i], dp_table[j][i-1]) + dp_table[i][j] = max(dp_table[i-1][j], dp_table[i][j-1]) -print(dp_table) +for i in dp_table: + print(i)