python声明一个长度为n的列表,Python：生成长度为N的所有唯一有序列表

还有一个解决方案：import numpy as np

from itertools import product, combinations

def rord(lst):

''' Maps the relative order of a list 'lst' to a unique string of 0, 1, and 2.

Relative order is computed by converting the list 'sgns' of all

the values sgn(lst[i]-lst[j])+1, for i

to a string.

E.g. the lists [0, 0, 1], [0, 0, 2] and [1, 1, 2] have the same rord = '100'

because lst[0] = lst[1], lst[0] < lst[1], lst[1] < lst[2] for all

of them, so sgns = [1, 0, 0]

'''

sgns = np.sign([tup[0]-tup[1] for tup in combinations(lst, 2)]) + 1

return ''.join(str(e) for e in sgns) # return sgns.tostring() is faster

def uniq_rord_lst(n):

'''Returns n-length sequences of integers 0,... n-1, with unique relative

order. E.g. for n=2 returns [(0, 0), (0, 1), (1, 0)].

'''

seen_ro = set()

result = []

for comb in product(range(n), repeat=n):

ro = rord(comb)

if ro not in seen_ro:

seen_ro.add(ro)

result.append(comb)

return result

示例：

^{pr2}$

更新：更快的更新def uniq_rord_lst(n):

seen_ro = set()

result = []

for comb in product(range(n), repeat=n):

ro = tuple(sorted(comb).index(x) for x in comb)

if ro not in seen_ro:

seen_ro.add(ro)

result.append(comb)

return result