Sep-11-2023, 12:14 AM
(This post was last modified: Sep-11-2023, 04:21 PM by deanhystad.)
I am looking for a Python code to find the longest common subsequence of two strings. I found a blog post that describes the problem and provides a solution in Java. I would like to implement the same solution in Python.
The blog post can be found here on longest common subsequence dynamic programming:
The Java code for the longest common subsequence problem is as follows:
python
Can you help me with this?
The blog post can be found here on longest common subsequence dynamic programming:
The Java code for the longest common subsequence problem is as follows:
python
1 2 3 4 5 6 7 8 9 10 11 12 13 |
def longestCommonSubsequence(X, Y): m = len(X) n = len(Y) dp = [[0 for i in range(n + 1)] for j in range(m + 1)] for i in range(m + 1): for j in range(n + 1): if i == 0 or j == 0: dp[i][j] = 0 elif X[i - 1] == Y[j - 1]: dp[i][j] = dp[i - 1][j - 1] + 1 else: dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]) return dp[m][n] |
deanhystad write Sep-11-2023, 04:21 PM:
Please post all code, output and errors (it it's entirety) between their respective tags. Refer to BBCode help topic on how to post. Use the "Preview Post" button to make sure the code is presented as you expect before hitting the "Post Reply/Thread" button.
Please post all code, output and errors (it it's entirety) between their respective tags. Refer to BBCode help topic on how to post. Use the "Preview Post" button to make sure the code is presented as you expect before hitting the "Post Reply/Thread" button.
