原书出处
Introduction to Algorithms, Fourth Edition
C 附录C 计数与概率
tems that we wish to count as a union of disjoint sets or as a Cartesian product of sets.
The rule of sum says that the number of ways to choose one element from one of two disjoint sets is the sum of the cardinalities of the sets. That is, if A and B are two finite sets with no
members in common, then |A ∪ B| = |A| + |B|, which follows from equation (B.3) on page 11
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix003.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea