- 设定dp长度为(n+1), 因为dp[i]要用来表示前i个(ith)时候的状态, 所以长度需要时i+1才可以在i位置, hold住i. - 双序列: 两个sequence之间的关系, 都是从末尾字符看起, 分析2种情况: - 1. A最后字符不在common sequence 或者 B最后字符不在common sequence. - 2. A/B最后字符都在common ...

What's the definition of longest increasing subsequence? The longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence's elements are in sorted order ...