最长公共子序列问题

最长公共子序列（动态规划）

实验数据：input.txt

X={A,B,C,B,D,A,B}

Y={B,D,C,A,B,A}

——要求给出X、Y的最长公共子序列Z，程序运行结束时，将计算结果输出到文件output.txt中。输出文件中包含问题的答案：找不到公共子序列时给出“null” 。

-Longest common subsequence problem LCS (dynamic programming) experimental data: input.txt X = {A, B, C, B, D, A, B}　Y = {B, D, C, A, B, A}- required to give X, Y of the longest common subsequence Z, the end run, will result in the output to the file output.txt. Output file contains the answer to the question: can not find the common sub-sequence gives " null" .