参考算法导论写的LCS算法，仿照STL的泛型风格，适用于多种STL容器中的各种类型数据构成的序列的最大公共子序列（Longest Common Subsequence）问题求解。-reference Introduction to write the algorithm LCS algorithm, modeled on the STL Generic style. STL is applicable to many types of containers data constitute the

寻找两个字符串中最长公共子串。 最长公共子串结果可能有多个的情况。 mfc图形界面。-Find the longest common subsequence of two strings in string. Longest Common Substring results may have more than one situation. mfc graphical interface.

利用最长公共子序列来比较两个文件的相似度，界面美观-Using the longest common subsequence similarity to compare two files, beautiful interface