77_longest_common_subsequence
给出两个字符串,找到最长公共子序列(LCS),返回LCS的长度。
说明
最长公共子序列的定义:
- 最长公共子序列问题是在一组序列(通常2个)中找到最长公共子序列(注意:不同于子串,LCS不需要是连续的子串)。该问题是典型的计算机科学问题,是文件差异比较程序的基础,在生物信息学中也有所应用。
- https://en.wikipedia.org/wiki/Longest_common_subsequence_problem
样例
给出"ABCD" 和 "EDCA",这个LCS是 "A" (或 D或C),返回1
给出 "ABCD" 和 "EACB",这个LCS是"AC"返回 2
class Solution:
"""
@param A: A string
@param B: A string
@return: The length of longest common subsequence of A and B
"""
def longestCommonSubsequence(self, A, B):
if len(A)==0 or len(B)==0:
return 0
arr =[[0 for col in range(len(B)+1)] for row in range(len(A)+1)]
for i in range(1,len(A)+1):
for j in range(1,len(B)+1):
if A[i-1] == B[j-1]:
arr[i][j] = arr[i-1][j-1] +1
else:
arr[i][j] = max(arr[i-1][j],arr[i][j-1])
return arr[i][j],arr
def getlongestCommonSubsequence(self, A, B,arr):
rlt = []
i = len(arr) - 1
j = len(arr[0]) - 1
while(i!= 0 and j!=0):
if(arr[i][j]!=arr[i-1][j]):
rlt.append(A[i-1])
i-=1
j-=1
while(arr[i][j]==arr[i][j-1]):
j-=1
else:
i-=1
return rlt
import numpy as np
a = Solution()
v,arr= a.longestCommonSubsequence('bedaacbade','dccaeedbeb')
print v
print np.array(arr)
print a.getlongestCommonSubsequence('bedaacbade','dccaeedbeb',arr)
5 [[0 0 0 0 0 0 0 0 0 0 0] [0 0 0 0 0 0 0 0 1 1 1] [0 0 0 0 0 1 1 1 1 2 2] [0 1 1 1 1 1 1 2 2 2 2] [0 1 1 1 2 2 2 2 2 2 2] [0 1 1 1 2 2 2 2 2 2 2] [0 1 2 2 2 2 2 2 2 2 2] [0 1 2 2 2 2 2 2 3 3 3] [0 1 2 2 3 3 3 3 3 3 3] [0 1 2 2 3 3 3 4 4 4 4] [0 1 2 2 3 4 4 4 4 5 5]] ['e', 'd', 'a', 'c', 'd']