Search - longest

Search - longest - List

[CSharp] repeat DL : 0: 最长重复子串问题 .问题描述：在一个特定字符串str 中，多次出现的子串称为重复子串。如果字符串str 中有多个重复子串，则其中长度最长的子串称为最长重复子串。例如，str=’abcdacdac’ ，则子串’cdac’ 是str 的最长重复子串。 .编程任务：给定一个字符串str ，编程计算str 的最长重复子串。-longest repeated substrings problems. Problem description : In a specific string str, repeated substrings called repeated substrings. If the string str There were several repeat substrings, which the length of the longest substrings called the longest repeat substrings. For instance, str = 'abcdacdac', substrings' cdac 'is the longest repeat str substrings. . Programming tasks : to set a string str, programmed to calculate the longest str repeat substrings.
Date : 2008-10-13 Size : 45.39kb User : 无翼
[CSharp] 最长子序列 DL : 0: 最长子序列~~教学程序-longest sequences ~ ~ teaching procedures
Date : 2008-10-13 Size : 9.79kb User : 正大
[CSharp] 最长子序列 DL : 0: 最长子序列~~教学程序-longest sequences ~ ~ teaching procedures
Date : 2025-12-26 Size : 28kb User : 正大
[CSharp] repeat DL : 0: 最长重复子串问题 .问题描述：在一个特定字符串str 中，多次出现的子串称为重复子串。如果字符串str 中有多个重复子串，则其中长度最长的子串称为最长重复子串。例如，str=’abcdacdac’ ，则子串’cdac’ 是str 的最长重复子串。 .编程任务：给定一个字符串str ，编程计算str 的最长重复子串。-longest repeated substrings problems. Problem description : In a specific string str, repeated substrings called repeated substrings. If the string str There were several repeat substrings, which the length of the longest substrings called the longest repeat substrings. For instance, str = 'abcdacdac', substrings' cdac 'is the longest repeat str substrings. . Programming tasks : to set a string str, programmed to calculate the longest str repeat substrings.
Date : 2025-12-26 Size : 45kb User : 无翼
[CSharp] TheLongestCommonSubsequence DL : 0: 本代码是用c#来实现最长公共子序列算法。-The c# code is used to achieve the longest common sub-sequence algorithm.
Date : 2025-12-26 Size : 26kb User : 堂堂
[CSharp] AntOnStick DL : 0: 蚂蚁爬杆，有c#图形界面，能计算出所有蚂蚁爬出杆的最短，最长的时间-Ants crawling under, and c# graphical interface that can calculate all the ants out of the shortest rod, the longest time
Date : 2025-12-26 Size : 442kb User : zly
[CSharp] zixulie DL : 0: 序列Z=<B，C，D，B>是序列X=<A，B，C，B，D，A，B>的子序列，相应的递增下标序列为<2，3，5，7>。一般地，给定一个序列X=<x1,x2,…,xm>，则另一个序列Z=<z1,z2,…,zk>是X的子序列，是指存在一个严格递增的下标序列〈i1,i2,…,ik〉使得对于所有j=1,2,…,k使Z中第j个元素zj与X中第ij个元素相同。给定2个序列X和Y，当另一序列Z既是X的子序列又是Y的子序列时，称Z是序列X和Y的公共子序列。你的任务是：给定2个序列X、Y，求X和Y的最长公共子序列Z。 -Sequence Z = <B，C，D，B> Is a sequence X = <A，B，C，B，D，A，B> Sub-sequences, the corresponding increment subscript sequence " 2,3,5,7" . In general, given a sequence X = <x1,x2,…,xm> , Another sequence Z = <z1,z2,…,zk> Is a sub-sequence of X is defined as the existence of a strictly increasing sequence of < i1,i2,…,ik> subscript such that for all j = 1,2, ..., k so that the first j elements in Z and X in the zj first ij the same elements. Given two sequences X and Y, when another sequence Z is X is Y sub-sequence of sub-sequences, that Z is a sequence of X and Y of the common sub-sequence of. Your task is: given two sequences X, Y, seeking X and Y of the longest common subsequence Z.
Date : 2025-12-26 Size : 861kb User : 谷
[CSharp] LCS_src DL : 0: Longest Common Substring LCS
Date : 2025-12-26 Size : 8kb User : Lugano
[CSharp] LMIS DL : 0: 动态规划求解最长单调递增子序列，给出了图形界面-Dynamic programming to solve the longest monotonically increasing subsequence given the graphical user interface
Date : 2025-12-26 Size : 327kb User : ethene
[CSharp] dancitongji DL : 0: 从磁盘文件中读一段英文（单词用空格分隔），统计其单词的个数，输出结果。找出最长的单词输出并输出其长度。-Read from a disk file in English (words separated by spaces), statistics the number of its words, the output results. Find the longest word in the output and output its length.
Date : 2025-12-26 Size : 1kb User : liulisha
[CSharp] long DL : 0: 利用C#开发的提取一个字符串中的最长重复字串-Developed using C# in a string to extract the longest string repeated
Date : 2025-12-26 Size : 20kb User : ch
[CSharp] LCS-program DL : 0: 求最长公共子序列Seeking the longest common subsequence-Seeking the longest common subsequence LCS program
Date : 2025-12-26 Size : 1.61mb User : yuanwenlong
[CSharp] sicily3 DL : 0: 输入一个字符串（字符串的长度不超过100），求出其中最长的回文子串的长度。子串的含义是：在原串中连续出现的字符串片段。回文的含义是：正着看和倒着看相同，如abba和yyxyy。-Enter a string (the length of the string is not more than 100), calculated the length of the longest palindrome substring. The substring meaning: the string fragment consecutive in the original string. Palindrome meaning: positive to see and look backwards, as abba and yyxyy,.
Date : 2025-12-26 Size : 6kb User : chen jian sheng
[CSharp] 1 DL : 0: 求串中最长重复子串数据结构习题 c++编写-Repeat for the longest substring
Date : 2025-12-26 Size : 171kb User : sky
[CSharp] Longestzixulie DL : 0: 最长子序列的寻找，简易实验写的.主要是两个序列之间的公共部分-Finding the longest sub-sequence, simple test writing. The main part is common between the two sequences
Date : 2025-12-26 Size : 707kb User : 潘茂林
[CSharp] HWTest11 DL : 0: 该段代码实现密码截取。对像ABBA，ABA，A,123321这样对称的码串变成12ABBA,ABAKK,51233214之后，找出输入码串中最长的有效码串。如输入 ABBA，输出长度4；输入abaaab，输出长度5(baaab的长度)-This code implements password interception.To like ABBA, ABA, A, 123321 such symmetrical code string into 12ABBA, ABAKK, 51233214, find out the longest valid string input code string.ABBA as input, output length 4 abaaab input, output the length 5 (length of baaab )
Date : 2025-12-26 Size : 2.82mb User :
[CSharp] 3 DL : 0: 设集合S由若干单词（英文）组成，给定字符串K，在S中查找与K最佳匹配的结果。最佳匹配的结果定义为：与K有最长共同前缀的字符串。例：S={abc, bdef, zhen, zhao, abdd}，K1=zhao，K2=abdf，K3=cheng，则与K1最匹配的结果是zhao，与K2最匹配的结果是abdd，与K3最匹配的结果是ε（空串）。 -Set the set S consists of several words (in English), with the given string K, and K to find the best match results in S. The results define the best match for: longest string and K have a common prefix. Example: S = {abc, bdef, zhen, zhao, abdd}, K1 = zhao, K2 = abdf, K3 = cheng, K1 is the best match and the result is zhao, and K2 is the best match abdd, and K3 most result of the matching is ε (the empty string).
Date : 2025-12-26 Size : 1kb User : jiegenghua
[CSharp] box DL : 0: C++ 语言实现数字最长路径之和的代码，通俗易懂，适合初学者参考。-C++ language and the digital code of the longest path, user-friendly, suitable for beginners reference.
Date : 2025-12-26 Size : 1kb User : lijix
[CSharp] zuichanggonggongzixulie DL : 0: 编写一个c程序，实现两个字符串的最长公共子序列，并输出解矩阵-C write a program to achieve the longest common subsequence of two strings, and the output matrix solution
Date : 2025-12-26 Size : 845kb User : 林翔