摘要: 题目描述:Find a longest common subsequence of two strings.输入:First and second line of each input casecontain 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 s 阅读全文
posted @ 2012-07-30 22:36 Eason Liu 阅读(276) 评论(0) 推荐(0) 编辑