← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

32 第32章 字符串匹配

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.767Z

n lexicographic order.3 That is, the ith suffix of T in lexicographic order is T[SA[i]:].

Along with the suffix array, another useful array is the longest common prefix array LCPOE[1:n]. The entry LCP[i] gives the length of the longest common prefix between the ith and (i – 1)st suffixes in the sorted order (with LCP[SA[1]] defined to be 0, since there is no prefix lexicographically smaller than T[SA[1]:]). Figure 32.11 shows the

suffix array and longest common prefix array for the 7-character text ratatat. Given the

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter032.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea