最長公共子序列-jobdu-1402(附帶打印)
jobdu-1042:Coincidence
時間限製:1 秒
內存限製:32 兆
題目描述:
Find a longest common subsequence of two strings.
輸入:
First and second line of each input case contain two strings of lowercase character a…z. There are no spaces before, inside or after the strings. Lengths of strings
do not exceed 100.
輸出:
For each case, output k – the length of a longest common subsequence in one line.
樣例輸入:
abcd
cxbydz
樣例輸出:
2
來源:
2008年上海交通大學計算機研究生機試真題 最長公共子序列
打印:
最後更新:2017-04-03 12:56:25