搜索资源列表
longest-common-string
- 这是动态规划中，求最长公共子序列（Longest common string）的源代码。自己编写执行。程序简单，有注释。
longest
- Problem B:Longest Ordered Subsequence A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... &l
longest
- 这是暑假写的最长公共子序列算法，呵呵， 欢迎大家来下载-Writing This is the longest summer vacation of public sequence algorithm, huh, huh, welcome everyone to download
longest
- 算法分析中动态规划法的经典例子，最长公子序列问题。VC++编写的C源码-Algorithm analysis, a classic example of dynamic programming, the longest sequence of the problem son. VC++ source code written in C
LongestIncSubSeq
- 求最长单调递增子序列。举例：原数组：1 5 1 3 1 56 21 6 86 2 1 6 5 22 1 5 9 62 1 3 56 31 1 56 3 1 1 66 3 1 6 6 3 1 6 6 1 结果： the longest monotonically increasing sub-sequence: Length: 14 Content:-Seeking the longest monotonically increasing subsequence. For exam
Babu_N_Parallel_Algorithms_for_the_Longest_Common
- Parallel Algorithms for the Longest Common Subsequence Problem
LCS
- 在C++环境下开发的最长公共子序列算法，可以下下来试试看-In C++ development environment, the longest common subsequence algorithm can try the next down
longest_common_subsequence
- 求出所有最长公共子序列（连续序列） 输入： malose malmose 输出： lcs_length=3 lcs_string=ose lcs_string=mal-ouput all the longest common subsequences. the subsequence must be series. for example: [input] malose malmose [output] lcs_length=3 lcs_stri
longest
- 从一个不超过80个字符的句子中找出一个句子中长度最长的单词-find the longest word of a sentence，which contains less than 80 words
key-route(the-longest)
- 这是关键结点里的最长路径算法代码，也是求路径的一个很麻烦的算法。-This is a key node in the longest path algorithm code, but also find a very troublesome path algorithm.
longest-substring
- 最长公共子序列递归算法，最长限制是10000字符-Longest common subsequence of a recursive algorithm, the maximum limit is 10,000 characters
The--longest-common-subsequence
- 本代码是算法设计中的最长公共子序列问题，通过C++编写。-This code is the longest common subsequence algorithm design, written by C++.
The-longest-common-subsequence
- 运用动态规划思想和策略，解决最长公共子序列问题。-The use of dynamic programming ideas and strategies to solve the longest common subsequence problem.
3-1-Longest-Increasing-Subsequence
- 3-1 Longest Increasing Subsequence
Longest-Common-Subsequences
- Longest Common Subsequences
longest-common-subsequence
- 本代码实现了算法导论书中最长公共子序列算法。-The longest common subsequence
longest-increasing-subsequence
- 数据结构 动态规划算法 最长递增子序列的C语言代码-Data structures dynamic programming algorithm longest increasing subsequence of C language code
Longest-repeated-substring
- 一个计算字符串中最长重复子串的算法，开发语言是C/C-A string of the longest repeated substring algorithm development of language is C/C++
the-longest-palindrome-substring
- 对于给定的一个字符串，求出其中最长的回文子串。其中子串的含义是：在原串中连续出现的字符串片段。本算法采用C++编程，一定是你不错的选择！-For a given string,we should find the longest palindrome substring. Which means that the substring: string fragment in the original string of consecutive. The algorithm uses the C++
Longest-Palindromic-Substring
- 这是一个求最长回纹序列的c++算法，简单易懂，感兴趣的可以-This is a request fret longest sequence c++ algorithm, easy to understand, are interested can look at