作者sharkbay (Shark Bay)
看板Python
標題[問題] 窮舉"將List中元素分群"的所有可能方法
時間Fri Jan 22 06:27:43 2021
目前已知這個方法能滿足這個題目, 但是空間或運算量太大, 想請問有沒有別的做法?
import itertools
powerset = lambda iterable: itertools.chain.from_iterable(
itertools.combinations(list(iterable), r)
for r in range(len(list(iterable)) + 1))
flatten = lambda list2d: [item for sublist in list2d for item in sublist]
x = list("abcd")
xx = [list(val) for val in list(powerset(x)) if 0 != len(val)]
xxx = [list(val) for val in list(powerset(xx)) if 0 != len(val)]
xxxx = [list(val) for val in xxx if x == list(sorted(flatten(val)))]
xxxx =
[[['a', 'b', 'c', 'd']],
[['a'], ['b', 'c', 'd']],
[['b'], ['a', 'c', 'd']],
[['c'], ['a', 'b', 'd']],
[['d'], ['a', 'b', 'c']],
[['a', 'b'], ['c', 'd']],
[['a', 'c'], ['b', 'd']],
[['a', 'd'], ['b', 'c']],
[['a'], ['b'], ['c', 'd']],
[['a'], ['c'], ['b', 'd']],
[['a'], ['d'], ['b', 'c']],
[['b'], ['c'], ['a', 'd']],
[['b'], ['d'], ['a', 'c']],
[['c'], ['d'], ['a', 'b']],
[['a'], ['b'], ['c'], ['d']]]
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 106.1.116.121 (臺灣)
※ 文章網址: https://webptt.com/m.aspx?n=bbs/Python/M.1611268065.A.18F.html
1F：推 LP9527: tuple+ set幾行就搞定了 01/22 13:28
3F：→ LP9527: 喔看錯了 01/22 13:47
4F：推 sherees: itertools.combinations 01/22 14:55
6F：→ ro9956882: [['a','b'],['c']]我用['ab','c']表示 這樣過程中不用 01/23 00:15
7F：→ ro9956882: 用到deepcopy 要轉換格式做完再一次轉 01/23 00:15
8F：→ ro9956882: 如果有重複元素(多個'a')就要再改一下 0.0 01/23 00:21
elements = list("abcdefghijl")
combinations = [[]]
for element in elements :
for i in range(len(combinations)):
for j in range(len(combinations[i])):
new = combinations[i][:]
new[j] += element
combinations.append(new)
combinations[i].append(element)
combinations = [list(sorted([list(c) for c in combination]))
for combination in combinations]
combinations = list(sorted(combinations))
我重抄一份在此
※ 編輯: sharkbay (106.1.116.121 臺灣), 01/23/2021 00:50:44
def partition(collection):
global counter
if len(collection) == 1:
yield [collection]
return
first = collection[0]
for smaller in partition(collection[1:]):
for n, subset in enumerate(smaller):
yield smaller[:n] + [[first] + subset] + smaller[n + 1:]
yield [[first]] + smaller
google到一份新的code
※ 編輯: sharkbay (106.1.116.121 臺灣), 01/23/2021 06:20:52