最长公共子串 Longest common substring problem
(重定向自Longest common substring)
在计算机科学中,最长公共子串问题是寻找两个或多个已知字符串最长的子串。
单词 | Longest common substring |
释义 |
Longest common substring
中文百科
最长公共子串 Longest common substring problem(重定向自Longest common substring)
在计算机科学中,最长公共子串问题是寻找两个或多个已知字符串最长的子串。
英语百科
Longest common substring problem 最长公共子串(重定向自Longest common substring)
![]() In computer science, the longest common substring problem is to find the longest string (or strings) that is a substring (or are substrings) of two or more strings. |
随便看 |
|
英汉双解词典包含3607232条英汉词条,基本涵盖了全部常用单词的翻译及用法,是英语学习的有利工具。