← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

32 第32章 字符串匹配

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

rders of the suffixes of T and the suffixes of the modified version of T are the same. A.

Construct two texts P1 and P2 made up of “metacharacters” that are actually substrings of three consecutive characters from T. We delimit each such metacharacter with parentheses. Construct P1 = (T[1:3])(T[4:6])(T[7:9]) ⋯ (T[n′:n′ + 2]), where n′ is the largest integer congruent to 1, modulo 3, that is less than or equal to n and T is extended beyond position n with the special character Ø, with encoding 0.

With the example text T = bippityboppityboo, we get that P1 = (bip) (pit) (ybo) (ppi) (ty

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea