搜索资源列表
06pop3
- 接收pop3 Public Function Retrieve(ByVal rhs As Pop3Message) As Pop3Message Dim message, response As String Dim msg As New Pop3Message msg.bytes = rhs.bytes msg.number = rhs.number message = \"RETR \" + rh
longest common substring
- 该程序完成在两个字符串中寻找最长公共子串，如果这样的字符串有多个，则将它们全部找出来，它在最坏情况下的复杂度为O(m*n).-the procedure is completed in two for the longest string of public substrings, if such a number of strings, will they all find out in the worst of the comple
stringprocess
- 字符串模式匹配，查找子串加以代替，有两种模式匹配算法-string pattern matching, substring search to be replaced, there are two types of pattern matching algorithm
Substring
- 用JAVA实现的字符串删除 功能的原代码 希望大家喜欢-JAVA realization of the string used to delete the original function code hope everyone likes
delete-all-specify-substring
- 给定一个字符串，和一个子串，删除所有指定字符串-delete all specify substring
substring
- c code to find a whether a substring is resent in a string-c code to find a whether a substring is resent in a string
Count-the--Substring
- 在一个顺序串中寻找子串，并记录子串在其中的个数。-In a sequence string to find substring, and recorded substring in which the number.
substring
- 求一个字符串中的连续出现次数最多的字串子串-Seeking a substring of consecutive maximum number in strings
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
The-biggest-public-substring
- 最大公共子串 直接上cpp 运行通过 包能用-The biggest public substring
the-max-common-substring
- 求字符串的最大公共子串，例如一个串为abcdefgh，另一个为abcefg，能够求出长度和子串abc和efg-Seeking the maximum common substring string, such as a string of abcdefgh, another for abcefg, can be obtained, and the length and substring abc efg
subString
- 输入两个不同的字符串。输出最长的公共子串。-Enter two different strings. The output of the longest common substring.
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.
Substring-search
- 查找子串的几种方法，比较简短，但很有用，一定正确的东西。希望有帮助-Substring search
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
- //动态规划求最长回文子串 //用布尔型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
5-Longest-Palindromic-Substring
- “回文串”是一个正读和反读都一样的字符串，比如“level”或者“noon”等等就是回文串。回文子串，顾名思义，即字符串中满足回文性质的子串。 Manacher算法- Palindrome string is a positive reading and verlan are the same string, such as level or noon and so is a palindrome string. Pali
substring
- A Java-like substring ( ) function equivalent for C/C++ language (with no pointer handling).
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.