python - 从结果集中消除连续的数字组合

Question

我有一个包含 30 个数字的列表:

[1, 3, 5, 6, 7, 8, 9, 10, 15, 19, 20, 22, 23, 24, 26, 27, 28, 32, 33, 35, 37, 38, 39, 40, 41, 42, 43, 44, 47, 48]

我正在打印所有可能的 8 位数字组合，使用此代码效果很好:

possible_combinations = itertools.combinations(dedup_list, 8) 

combos = []
for e in possible_combinations:
    combos.append(e)
print combos

我现在想做的是消除所有包含连续 3 位数字的组合，例如:

[1, 5, 9,22, 23, 24, 33, 37]

建议？

Answer 1

我认为这可以解决问题:

from itertools import combinations, groupby
from operator import itemgetter

data = [1, 3, 5, 6, 7, 8, 9, 10, 15, 19, 20, 22, 23, 24, 26, 27, 28, 32, 33, 35, 37, 38, 39, 40, 41, 42, 43, 44, 47, 48]

def find_consecutive(lst, min_string=3):
    for k, g in groupby(enumerate(lst), lambda (i,x):i-x):
        num_string = map(itemgetter(1), g)
        if len(num_string) >= 3:
            yield num_string

for i in combinations(data, 8):
    if not any(find_consecutive(i, min_string=3)):
        print i

返回:

(1, 3, 5, 6, 8, 9, 15, 19)
(1, 3, 5, 6, 8, 9, 15, 20)
(1, 3, 5, 6, 8, 9, 15, 22)
(1, 3, 5, 6, 8, 9, 15, 23)
(1, 3, 5, 6, 8, 9, 15, 24)

...等等，等等