all permutations of a binary sequence x bits long

点点圈 提交于 2019-11-26 11:02:00

问题


I would like to find a clean and clever way (in python) to find all permutations of strings of 1s and 0s x chars long. Ideally this would be fast and not require doing too many iterations...

So, for x = 1 I want: [\'0\',\'1\'] x =2 [\'00\',\'01\',\'10\',\'11\']

etc..

Right now I have this, which is slow and seems inelegant:

    self.nbits = n
    items = []
    for x in xrange(n+1):
        ones = x
        zeros = n-x
        item = []
        for i in xrange(ones):
            item.append(1)
        for i in xrange(zeros):
            item.append(0)
        items.append(item)
    perms = set()
    for item in items:
        for perm in itertools.permutations(item):
            perms.add(perm)
    perms = list(perms)
    perms.sort()
    self.to_bits = {}
    self.to_code = {}
    for x in enumerate(perms):
        self.to_bits[x[0]] = \'\'.join([str(y) for y in x[1]])
        self.to_code[\'\'.join([str(y) for y in x[1]])] = x[0]

回答1:


itertools.product is made for this:

>>> import itertools
>>> ["".join(seq) for seq in itertools.product("01", repeat=2)]
['00', '01', '10', '11']
>>> ["".join(seq) for seq in itertools.product("01", repeat=3)]
['000', '001', '010', '011', '100', '101', '110', '111']



回答2:


There's no need to be overly clever for something this simple:

def perms(n):
    if not n:
        return

    for i in xrange(2**n):
        s = bin(i)[2:]
        s = "0" * (n-len(s)) + s
        yield s

print list(perms(5))



回答3:


You can use itertools.product() for doing this.

import itertools
def binseq(k):
    return [''.join(x) for x in itertools.product('01', repeat=k)]



回答4:


Python 2.6+:

['{0:0{width}b}'.format(v, width=x) for v in xrange(2**x)]



回答5:


Kudos to all the clever solutions before me. Here is a low-level, get-you-hands-dirty way to do this:

def dec2bin(n):
    if not n:
        return ''
    else:
        return dec2bin(n/2) + str(n%2)

def pad(p, s):
    return "0"*(p-len(s))+s

def combos(n):
    for i in range(2**n):
        print pad(n, dec2bin(i))

That should do the trick



来源:https://stackoverflow.com/questions/4928297/all-permutations-of-a-binary-sequence-x-bits-long

易学教程内所有资源均来自网络或用户发布的内容,如有违反法律规定的内容欢迎反馈
该文章没有解决你所遇到的问题?点击提问,说说你的问题,让更多的人一起探讨吧!