原书出处
Introduction to Algorithms, Fourth Edition
32 第32章 字符串匹配
T[i:] 13 if l > 0 14 l = l – 1 // peel off first character of common prefix 15 return LCP
Lemma 32.8 Consider suffixes T[i – 1:] and T[i:], which appear at positions rank[i – 1] and rank[i], respectively, in the lexicographically sorted order of suffixes. If LCP[rank[i – 1]] = l > 1, then the suffix T[i:], which is T[i – 1:] with its first character removed, has LCP[rank[i]] ≥ l – 1.
Proof The suffix T[i – 1:] appears at position rank[i – 1] in the lexicographically sorte
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter032.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea