分享一下我老师大神的人工智能教程!零基础,通俗易懂!http://blog.csdn.net/jiangjunshow
也欢迎大家转载本篇文章。分享知识,造福人民,实现我们中华民族伟大复兴!
1. 调用 scipy 计算排列组合的具体数值
A23=6,(32)=3
>> from scipy.special import comb, perm>> perm(3, 2)6.0>> comb(3, 2)3.0
- 1
- 2
- 3
- 4
- 5
2. 调用 itertools 获取排列组合的全部情况数
>> from itertools import combinations, permutations>> permutations([1, 2, 3], 2)<itertools.permutations at 0x7febfd880fc0> # 可迭代对象>> list(permutations([1, 2, 3], 2))[(1, 2), (1, 3), (2, 1), (2, 3), (3, 1), (3, 2)]>> list(combinations([1, 2, 3], 2))[(1, 2), (1, 3), (2, 3)]
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9