搜索资源列表
[转载]nlogn的最长子序列算法
- 关于用nlogn的最长子序列算法，在网上摘录的-discusses the use of the longest sequences algorithm, in the extract from the Internet
公共子序列
- 本算法实现的是对两个单字符串的扫描，找出其最长公共子序列。-the algorithm to achieve the two-string scan, identify its longest public sequences.
The-longest-common-subsequence
- 运用动态规划思想和策略，解决最长公共子序列问题。-The use of dynamic programming ideas and strategies to solve the longest common subsequence problem.
The-longest-common-subsequence-
- 最长公共子序列问题 第一步 最优子结构: 第二步：建立递归式 第三步：计算最优值 -The longest common subsequence problem
The-longest-Masuga-Ko-sequence
- ∏=｛8，7，4，2，5，1，9，3，10，6｝ f(j)以第j个元素Pi(j)为最后一个元素的最长增长子序列的长度。 f(j) = max{f(i)+1, 1}, a[i]<a[j], 0<i<j -Π = {8,7,4,2,5,1,9,3,10,6} f (j) to the j-th element Pi (j) is the last element of the longest
3-1-Longest-Increasing-Subsequence
- 3-1 Longest Increasing Subsequence
longest-word
- 输入一串字符串，求出其中最长的单词。仅限于英文字符串，且有字符长度限制。-Enter a bunch of strings, find the longest word. English only strings, and there is a character length limit.
Longest-Common-Subsequences
- Longest Common Subsequences
longest-common-subsequence
- 本代码实现了算法导论书中最长公共子序列算法。-The longest common subsequence
Longest-Prefix
- the solution to the usaco problem Longest prefix
longest-increasing-subsequence
- 数据结构 动态规划算法 最长递增子序列的C语言代码-Data structures dynamic programming algorithm longest increasing subsequence of C language code
finding-the-longest-word
- 在一串字符串之中，找到最长的单词，然后把它列举出来-In a string, find the longest word, then list it out.
The-longest-common-substring
- 最长公共子串，包括一个动态规划法的两个字符串最长公共子串的计算，和多个字符串最长公共子串的C代码-Longest common substring, including two strings of a dynamic programming method of computing the longest common substring, and multiple string longest common substring of
Longest-repeated-substring
- 一个计算字符串中最长重复子串的算法，开发语言是C/C-A string of the longest repeated substring algorithm development of language is C/C++
Longest-common-substring
- 求两个输入序列的最长的公共子字符串的长度。子字符串中的所有字符在源字符串中必须相邻。-Length of the input sequence is the sum of two longest common substring. Substring of all the characters in the source string must be contiguous.
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 consecuti
Longest-Palindromic-Substring
- 这是一个求最长回纹序列的c++算法，简单易懂，感兴趣的可以-This is a request fret longest sequence c++ algorithm, easy to understand, are interested can look at
Longest-Palindromic-Substring
- //动态规划求最长回文子串 //用布尔型t[i][j]表示子串（s(i....j))是否为回文子串 //其中t[i][j]的值可通过t[i+1][j-1]的值以及是s[i]和s[j]是否相等判断（即子串（s(i...j))是否为回文子串可通过子问题s（i+1,...,j-1)是否为回文串来解决） //通过left和right来指示当前最长回文子串的下标-// Dynamic programming longest palin
Longest-Palindromic-Substring
- Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.
Longest common subsequence
- 用动态规划思想设计实现最长公共子序列问题，用贪心思想设计实现活动安排问题，并且用不同数据量进行对比分析。(We use dynamic programming theory to design the longest common subsequence problem. We use greedy thought to design the activity scheduling problem, and compare it wit