onyx_online/grokking-algorithms
1
0
Fork 0
mirror of https://github.com/onyx-and-iris/grokking-algorithms.git synced 2024-11-15 17:30:52 +00:00
Code Issues Packages Projects Releases Wiki Activity

fix var name

Browse Source
This commit is contained in:
onyx-and-iris 2024-01-17 15:24:46 +00:00
parent c6b0b0d276
commit 21a13acbff
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
chapter11/subsequence.py
View File

@ -42,13 +42,13 @@ X = "fosh"
Y = "fort" Y = "fort"
logger.info(f"words: {X} {Y}") logger.info(f"words: {X} {Y}")
longest_substring = longest_common_subsequence(X, Y, len(X), len(Y)) longest_subsequence = longest_common_subsequence(X, Y, len(X), len(Y))
print(f"Longest common subsequence: {longest_substring}") print(f"Longest common subsequence: {longest_subsequence}")
X = "fosh" X = "fosh"
Y = "fish" Y = "fish"
logger.info(f"words: {X} {Y}") logger.info(f"words: {X} {Y}")
longest_substring = longest_common_subsequence(X, Y, len(X), len(Y)) longest_subsequence = longest_common_subsequence(X, Y, len(X), len(Y))
print(f"Longest common subsequence: {longest_substring}") print(f"Longest common subsequence: {longest_subsequence}")