原书出处
Introduction to Algorithms, Fourth Edition
C 附录C 计数与概率
of possible sundaes with one scoop of ice cream and one topping is 28 · 4 = 112. Strings
A string over a finite set S is a sequence of elements of S. For example, there are eight binary strings of length 3: 000, 001, 010, 011, 100, 101, 110, 111. (Here we use the shorthand of
omitting the angle brackets when denoting a sequence.) We sometimes call a string of leng
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix003.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea