原书出处
Introduction to Algorithms, Fourth Edition
32 第32章 字符串匹配
tern of length m, and let π be the prefix function for P. Then, for q = 2, 3, …, m, Proof
If Eq–1 is empty, there is no k ∈ π*[q – 1] (including k = 0) such that extending P[:k] to P[:k + 1] produces a proper suffix of P[:q]. Therefore, π[q]= 0.
If, instead, Eq–1 is nonempty, then for each k ∈ Eq–1, we have k + 1 < q and P[:k + 1] ⊐
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter032.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea