【文件属性】:
文件名称:Suffix-Array-and-LCP
文件大小:761KB
文件格式:ZIP
更新时间:2021-07-05 14:45:26
Java
后缀阵列和 LCP
后缀数组和最长公共前缀
注意:我们保证每条线的长度相等。
给定 k = 2, 3, ..., 10 的字符串 find,出现 k 次的最长字符串是什么? 注意:如果输入是aaaaa,出现两次的最长字符串是aaaa
例如,如果这个输入文件是:
AAAB
AABA
ABBB
输出看起来像
Longest sequence that occurs 2 times has basic length 6 and is AABAAB
Occurrence # 1 starts at line 1
Occurrence # 2 starts at line 2
Longest sequence that occurs 3 times has basic length 3 and is AAB
Occurrence # 1 starts at line 1
Occurrenc
【文件预览】:
Suffix-Array-and-LCP-master
----Suffix-Array-and-LCP()
--------manifest.mf(82B)
--------src()
--------build()
--------build.xml(3KB)
--------nbproject()
--------OUTPUT.txt(31KB)
----DataFiles()
--------DataFiles()
----README.md(717B)