搜索资源列表
LCS
- 这是一个合并两个文件的工程,用来将两个文件合并,相同部分保留一次,不同部分一次写入,其中利用了求最大公共子序列的算法-This is a merger of the two files works, used to merge two files, the same part of the reservation time, different parts of the write-once, which demand the greatest advantage of the common s
LongCommonSubstrng
- 算法问题,求公共最长自序列,采用动态规划求最优解。-LCS Question DP
lcs
- 这是一个实现lcs算法问题的java代码,其中有比较简单的swing和AWT的使用,但是算法是成功的可以借鉴-This is a realization of java code lcs algorithm for the problem, which has a relatively simple swing and AWT use, but the algorithm can learn to be successful
lcs
- 求两个序列的最长公共子序列 算法导论课程小设计;带界面-algorithm project HITSZ irvingluo
lcs
- 随机生成两个长度为1000的字母序列,利用动态规划算法实现求最长公共子序列,并输出最长公共子序列的长度,一般是320左右。-Two randomly generated sequence of letters of length 1000, the use of dynamic programming algorithm for the longest common subsequence, and the output length of the longest common subseque