DP_LCS
摘要：
The Longest Common Subsequence problemGive two strings a and b. return the length of the longest common subsequence of them.Note: characters in subsequence needn’t to be consecutive, but in subs... 阅读全文
posted @ 2009-06-05 12:01 翰墨小生 阅读(553) 评论(1) 推荐(0) 编辑
