python里1和0_Python中数组中1和0的组合

最新推荐文章于 2022-05-28 22:35:00 发布

weixin_39623050

最新推荐文章于 2022-05-28 22:35:00 发布

阅读量468

点赞数

文章标签： python里1和0

本文链接：https://blog.csdn.net/weixin_39623050/article/details/111962139

版权

本文介绍了如何利用Python的itertools模块中的combinations函数，生成包含四个1和四个0的二维数组排列。通过理解组合的概念，避免了不必要的解决方案迭代，提高了效率。示例代码展示了如何实现这一功能，并输出了所有可能的组合结果。

摘要由CSDN通过智能技术生成

I want to make a combination of 1's and 0's in a 2d array like the following:

[[ 1, 1, 1, 1, 0, 0, 0, 0 ],

[ 1, 1, 1, 0, 1, 0, 0, 0 ],

[ 1, 1, 1, 0, 0, 1, 0, 0 ],

[ 1, 1, 1, 0, 0, 0, 1, 0 ],

[ 1, 1, 1, 0, 0, 0, 0, 1 ],

]

That means a combination of four 1's and four 0's. I have looked at the itertools module's permutations() and combinations(), but couldn't find any suitable functions to perform this combination.

解决方案

You can also use combinations to generate unique combinations directly:

n = 8

n1 = 4

for x in itertools.combinations( xrange(n), n1 ) :

print [ 1 if i in x else 0 for i in xrange(n) ]

[1, 1, 1, 1, 0, 0, 0, 0]

[1, 1, 1, 0, 1, 0, 0, 0]

[1, 1, 1, 0, 0, 1, 0, 0]

[1, 1, 1, 0, 0, 0, 1, 0]

...

[0, 0, 0, 1, 1, 1, 0, 1]

[0, 0, 0, 1, 1, 0, 1, 1]

[0, 0, 0, 1, 0, 1, 1, 1]

[0, 0, 0, 0, 1, 1, 1, 1]

This is more efficient than permutations because you don't iterate over unwanted solutions.

The intuition is that you're trying to find all possible ways to fit four "1"s in a sequence of length 8; that's the exact definition of combinations. That number is C(8,4)=8! / (4! * 4!) = 70. In contrast, the solution using permutations iterates over 8! = 40,320 candidate solutions.