搜索资源列表
HW2.rar
- we solve the LCS (LONGEST COMMON SUBSTRİ NG ) problem in this code with two different way One of them is dynamic programming.,we solve the LCS (LONGEST COMMON SUBSTRİ NG ) problem in this code with two different way One of them is dynamic pro
LCS
- Longest common subsequence problem. It is dynamic approach based problem.
LCS
- 利用动态规划技术和递推的办法,求出两个字母表A和B的最大公共字串长度。-The use of dynamic programming techniques and recursive approach to find the two alphabets A and B, the largest public string length.
LCS
- 算法设计与分析课程中用动态规划算法求解最长公共子序列问题,C语言写的,很实用,有b数组和c数组的输出,很适合初学者一步一步走程序。-Algorithm design and analysis programs using dynamic programming algorithm for solving the longest common subsequence problem, C language written, very practical, with b and c array ar
HDOJ-1080--LCS
- HDOJ 1080 动态规划题目。欢迎各种讨论交流。-The dynamic programming topics HDOJ 1080. Welcome discussions AC.
lcs
- 动态规划 最长子字符串匹配 可以输出多个匹配的子字符串 算法导论-Dynamic programming longest substring matching substring can output multiple matches Introduction to Algorithms
LCS_Dynamic-planning
- 动态规划应用 动态规划算法解最长公共子序列LCS问题-Dynamic programming dynamic programming algorithm for solving the longest common subsequence LCS problem