摘要: LCS(Longest Common Subsequence) 就是求两个字符串最长公共子串的问题。比如: String str1 = new String("adbccadebbca"); String str2 = new String("edabccadec... 阅读全文
posted @ 2015-06-13 12:25 落影无痕 阅读(366) 评论(0) 推荐(0)