原书出处
Introduction to Algorithms, Fourth Edition
32 第32章 字符串匹配
1 for the relevant definitions. For expository purposes, let’s assume that ∑ = {0, 1, 2, …
, 9}, so that each character is a decimal digit. (In the general case, you can assume that each character is a digit in radix-d notation, so that it has a numerical value in the range 0 to d – 1, where d = |∑|.) You can then view a string of k consecutive characters as representing a length-k decimal number. For example, the character string 31415
corresponds to the decimal number 31,415. Because we interpret the input characters as bo
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter032.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea