原书出处
Introduction to Algorithms, Fourth Edition
32 第32章 字符串匹配
racter in the text is represented by an underlying encoding, which is a positive integer.
The idea behind the linear-time algorithm is to compute the suffix array for the suffixes starting at 2/3 of the positions in the text, recursing as needed, use the resulting information to sort the suffixes starting at the remaining 1/3 of the positions, and then merge the sorted information in linear time to produce the full suffix array. For i = 1, 2,
…, n, if i mod 3 equals 1 or 2, then i is a sample position, and the suffixes starting at
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter032.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea