下降星座与你的爱情zz# astrology - 星座物语
k*i
1 楼
网上查到说可以用 suffix tree:
The longest palindrome of txt[1..n] can be found in O(n) time, e.g. by
building the suffix tree for txt$reverse(txt)# or by building the
generalized suffix tree for txt and reverse(txt).
具体在建立了 suffix tree之后如何查找 longest palindrome ?
那位高人给指点一下?
The longest palindrome of txt[1..n] can be found in O(n) time, e.g. by
building the suffix tree for txt$reverse(txt)# or by building the
generalized suffix tree for txt and reverse(txt).
具体在建立了 suffix tree之后如何查找 longest palindrome ?
那位高人给指点一下?