用python求解组合问题
改动一下排列的代码，迅速变成组合问题的求解：def perm(n,m,current,lists=[]):if m == len(lists):print ' '.join( map(str,lists))return 1sum = 0for i in range(current,n+1):if i not in lists:sum+=perm(n,m,i+1,lists+)return sumn,m = print perm(n,m,1)
python 上手果真比较快..
页:
[1]