← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

32 第32章 字符串匹配

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

ted, either by line 8 before the first iteration or by line 18 in the previous iteration.

MAKE-RANKS takes a substr-rank array, which has been sorted, and fills in an array rank[1:n] so that rank[i] is the rank of the ith substring represented in the substr-rank array. Each rank is a positive integer, starting from 1, and going up to the number of unique substrings of length 2l. Substrings with equal values of left-rank and right-rank receive the same rank. Otherwise, a substring that is lexicographically smaller than another appears earlier in the substr-rank array, and it receives a

smaller rank. Once the substrings of length 2l are re-ranked, line 18 sorts them by rank,

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea