ทุ permutations เป็นภาษาไพธอน
import itertools
print(list(itertools.permutations([1,2,3])))
pyhton permutations
# A Python program to print all permutations using library function
from itertools import permutations
perm = permutations([1, 2, 3])
for i in list(perm):
print (i)
# (1, 2, 3)
# (1, 3, 2)
# (2, 1, 3)
# (2, 3, 1)
# (3, 1, 2)
# (3, 2, 1)
ปลั๊กอินสำหรับไพธอน permutation
import itertools
a = [1, 2, 3]
n = 3
perm_iterator = itertools.permutations(a, n)
for item in perm_iterator:
print(item)
ปลั๊กอินสำหรับไพธอน permutation รายการ
def permutations(iterable, r=None):
# permutations('ABCD', 2) --> AB AC AD BA BC BD CA CB CD DA DB DC
# permutations(range(3)) --> 012 021 102 120 201 210
pool = tuple(iterable)
n = len(pool)
r = n if r is None else r
if r > n:
return
indices = list(range(n))
cycles = list(range(n, n-r, -1))
yield tuple(pool[i] for i in indices[:r])
while n:
for i in reversed(range(r)):
cycles[i] -= 1
if cycles[i] == 0:
indices[i:] = indices[i+1:] + indices[i:i+1]
cycles[i] = n - i
else:
j = cycles[i]
indices[i], indices[-j] = indices[-j], indices[i]
yield tuple(pool[i] for i in indices[:r])
break
else:
return
print ( list(permutations([1, 2, 3], 2)) )
# [(1, 2), (1, 3), (2, 1), (2, 3), (3, 1), (3, 2)]
ปลั๊กอินสำหรับไพธอน combinations ฟังก์ชัน
def combinations(iterable, r):
pool = tuple(iterable)
n = len(pool)
for indices in permutations(range(n), r):
if sorted(indices) == list(indices):
yield tuple(pool[i] for i in indices)