← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

32 第32章 字符串匹配

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

ration lemma) Let P be a pattern of length m with prefix function π. Then, for q = 1, 2, …

, m, we have π*[q] = {k : k < q and P[:k] ⊐ P[:q]}. Proof We first prove that π*[q] ⊆ {k : k < q and P[:k] ⊐ P[:q]} or, equivalently, If i ∈ π*[q], then i = π(u)[q] for some u > 0. We prove equation (32.7) by induction on u. For u = 1, we have i = π[q], and the claim follows since i

< q and P[:π[q]] ⊐ P[:q] by the definition of π. Now consider some u ≥ 1 such that both π

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea