Lcs

代码说明：

  求最长公共子序列。本算法使用动态规划算法，解得最长公共子序列问题。(Find the longest common subsequence. The algorithm uses a dynamic programming algorithm, the solution was the longest common subsequence problem.)