搜索资源列表
3
- 3.1 最长公共子序列问题 最长公共子序列(动态规划) 实验数据:input.txt X={A,B,C,B,D,A,B} Y={B,D,C,A,B,A} ——要求给出X、Y的最长公共子序列Z,程序运行结束时,将计算结果输出到文件output.txt中。输出文件中包含问题的答案:找不到公共子序列时给出“null” 。 -3.1 the longest common subsequence problems lon
test
- 动态规划法求两个序列的最长公共子序列及其长度-The dynamic programming method to seek the longest common subsequence and its length of two sequences
12
- 寻找最长公共子序列,用东太贵黄算法实现,算法导论课上的作业,可以直接使用-Find the longest common subsequence East expensive yellow algorithm implementation, and operating in the Introduction to Algorithms class, can be used directly
zixulie
- 求两个字符串的最长公共子序列X 的一个子序列是相应于X 下标序列{1, 2, …, m}的一个子序列,求解两个序列的所有 子序列中长度最大的,例如输入:pear, peach 输出:pea。 -Seeking two strings of the longest common subsequence
dp-problem
- 这个包括了 ACM比赛中 经常会用到的动态递归算法的一些经典例题,例如背包问题,最长公共子序列等的源代码-This includes the classic example of the dynamic recursive algorithm is often used in the ACM competition, such as the knapsack problem, the longest common subsequence
The-most-architectural-sequence
- Java实现最大子序列问题,算法导论实验三-Java implementation of the maximum subsequence problem, algorithms, Introduction to Experimental
MERGE-SORT
- 合并排序是建立在归并操作上的一种有效的排序算法。该算法是采用分治法(Divide and Conquer)的一个非常典型的应用。 合并排序法是将两个(或两个以上)有序表合并成一个新的有序表,即把待排序序列分为若干个子序列,每个子序列是有序的。然后再把有序子序列合并为整体有序序列。 将已有序的子序列合并,得到完全有序的序列;即先使每个子序列有序,再使子序列段间有序。若将两个有序表合并成一个有序表,称为2-路归并。合并排序也叫归并排序。-M
nyoj16
- 经典算法,最大单调递增子序列,查看最多能嵌入多少个矩形-The classical algorithm monotonically incrementing subsequence view can be embedded in the number of rectangular
11
- 算法分析 C语言编程实现最长公共子序列的源代码-C language programming source code of the longest common subsequence
LCS
- longest common subsequence using dynammic programmin
long
- 主要是来求两个字符串的最长公共子序列,字符串在代码中已给出-Is to seek the longest common subsequence of two strings, the string has been given in the code
LCSwork
- 最长公共子序列,可通过文本输入或者控制台输入,上传为源代码的txt文本,需自行建立项目与文件;-Longest common subsequence, text input or console input, upload txt text of the source code, create your own projects and documents
LCS
- 最长公共子序列,VC++6.0的经典算法。-The longest common subsequence the, VC++6.0 classic algorithm.
Greedy
- 最长公共子序列的求解,数据输入为data.txt-Longest common subsequence solving, data input data.txt
MaxSum
- 求子序列最大值的实现算法-Subsequence maximum! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! !
length
- 求两个字符串的最长公共子序列,可以手动输入也可以从文件读入字符串,字符串中允许有空格出现,这是广西大学的算法实验代码,如果是本校学生下载请注意修改,这是我自己写的,写得不好请海涵。-Seeking the longest common subsequence of two strings, you can manually input can also be read from a file into a string, string
LCS
- x,y两个序列,通过动态规划的方法来解决最长子序列的问题。-Longest subsequence
LCS
- 用Java实现的LCS最大公共子序列算法,输入从文件中读取ASCII码-LCS common subsequence algorithm implemented in Java, the input is read from the file in ASCII
sub
- 通过此程序,运用算法,实现最长子序列,帮助找出最长子序列。-Through this program, the use of the algorithm, the longest sub-sequence, to help find the longest subsequence.
LCS
- 求任意长度的字符串的最长公共子序列,实现对任意输入的两个字符串,输出最长公共子序列-The longest common subsequence seek any length of string