← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

32 第32章 字符串匹配

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

ve integers less than or equal to n, coming from their relative order after being sorted.

An empty substring always has rank 0, since it is lexicographically less than any nonempty substring. COMPUTE-SUFFIX-ARRAY(T, n) 1 allocate arrays substr-rank[1:n], rank[1:n], and SA[1:n] 2 for i = 1 to n 3 substr-rank[i].left-rank = ord(T[i]) 4 if i < n 5 substr-rank[i].right-rank = ord(T[i + 1]) 6 else substr-rank[i].right-rank = 0 7 substr-rank[i].index = i 8 sort the array substr-rank into monotonically increasing order based on the

left-rank attributes, using the right-rank attributes to break ties; if still a tie, the

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea