资 源 简 介
最长公共子字符串的java实现（longest common subsequence）：
Given two strings x = x1x2 · · · xn and y = y1y2 · · · ym, we wish to find the length of their longest
common subsequence, that is, the largest k for which there are indices i1 < i2 < · · · < ik and
j1 < j2 < · · · < jk with xi1 xi2
· · · xik = yj1
yj2
· · · yjk
. Design an algorithm with time complexity
being O(mn).
