擅长:python、mysql、java
<p>如果我没搞错,你可以这样做:</p>
<pre><code>from itertools import combinations
def count_consecutive(l):
counts = [1]
counts_index = 0
for i in range(1, len(l)):
if l[i] == l[i-1] + 1:
counts[counts_index] = counts[counts_index] + 1
else:
counts.append(1)
counts_index += 1
return max(counts)
f = open('C:/combinations.txt', 'w')
for comb in combinations(range(1,36), 7):
if count_consecutive(comb) not in [5, 6, 7]:
f.write(str(comb))
f.write('\n')
f.close()
</code></pre>
<p>它节省了6724520中的12615,相当于0.18%,结果是180.5 MB的文件。在</p>