原书出处
Introduction to Algorithms, Fourth Edition
32 第32章 字符串匹配
:i]), a) = ϕ(T[:i]a) = σ(P[:q]a) (with the last equality following from equation (32.5)).
There are two cases to consider, depending on whether the next character continues to match the pattern. In the first case, a = P[q + 1], so that the character a continues to match the pattern. In this case, because δ(q, a) = q + 1, the transition continues to go along the “spine” of the automaton (the blue edges in Figure 32.6(a)). In the second case, a ≠ P[q + 1], so that a does not extend the match being built. In this case, we need to find the longest prefix of
P that is also a suffix of T[:i]a, which will have length at most q. The preprocessing st
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter032.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea