文件名称:longest common substring
介绍说明－－下载内容均来自于网络，请自行研究使用
该程序完成在两个字符串中寻找最长公共子串，如果这样的字符串有多个，则将它们全部找出来，它在最坏情况下的复杂度为O(m*n).-the procedure is completed in two for the longest string of public substrings, if such a number of strings, will they all find out in the worst of the complexity of O (n* m).
(系统自动生成,下载前可以参看下载内容)
下载文件列表
longest common substring.doc