lostecho/grokking_algorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

reorg and add code for second edition

Browse Source
This commit is contained in:
Aditya Bhargava
2023-08-09 08:20:19 -05:00
parent 9306432a1b
commit 933acafaf3
89 changed files with 18 additions and 117 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
11_dynamic_programming/python/01_longest_common_subsequence.py Normal file
View File

@@ -0,0 +1,13 @@
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)
for i in range(0, len(dp_table_blue)):
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
else:
dp_table[j][i] = max(dp_table[j-1][i], dp_table[j][i-1])
print(dp_table)

13
11_dynamic_programming/python/02_longest_common_substring.py Normal file
View File

@@ -0,0 +1,13 @@
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)
for i in range(0, len(dp_table_blue)):
for j in range(0, len(dp_table_clues)):
if dp_table_clues[j] == dp_table_blue[i]:
dp_table[i][j] = dp_table[i-1][i-1] + 1
else:
dp_table[i][j] = 0
print(dp_table)