原书出处
Introduction to Algorithms, Fourth Edition
32 第32章 字符串匹配
the longest string z such that z ⊏ x and z ⊏ y. 32.1 The naive string-matching algorithm
The NAIVE-STRING-MATCHER procedure finds all valid shifts using a loop that checks the condition P[1:m] = T[s+1:s+m] for each of the n−m+1 possible values of s. NAIVE-STRING-MATCHER(T, P, n, m) 1 for s = 0 to n – m 2 if P[1:m] == T[s + 1:s + m] 3 print “Pattern occurs with shift” s Figure 32.3 portrays the naive string-matching procedure as sliding a
“template” containing the pattern over the text, noting for which shifts all of the chara
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter032.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea