最长公共子序列算法
最长的公共子序列 (Longest common Subsequence)
Let X and Y be two subsequences and by LCS algorithm we can find a maximum length common subsequence of X and Y.
令X和Y为两个子序列,通过LCS算法,我们可以找到X和Y的最大长度公共子序列 。
If |X|= m and |Y|= n then there is a 2m subsequence of x; we just compare each with Y (n comparisons).
如果| X | = m且| Y | = n,则存在x的2m子序列; 我们只将每个与Y比较(n个比较) 。
So the running time of this particular algor