最优子结构
设序列 X = {x1, x2, ..., xm} 和序列 Y = {y1, y2, ... , yn} 的最长公共子序列为 Z = {z1, z2, ... , zk}, 那么
(1)若xm = yn = zk, 则 zk-1也是xm-1和yn-1的LCS
(2)若xm!=yn, xm!=zk, 则Z是xm-1和yn的LCS
(3)若yn!=xm, yn!=zk, 则Z是xm和yn-1的LCS
子问题递归关系
用dp[i][j]记录Xi和Yj的LCS
0 i = 0, j = 0
dp = [i][j] = dp[i-1][j-1] i > 0; xi = yj
max{dp[i][j-1], dp[i-1][j]}i,j > 0; xi != yj