擅长:python、mysql、java
<p>你可以这样做。这基本上会创建序列的子列表,当序列被破坏时,它会将其添加到结果中。你知道吗</p>
<pre class="lang-py prettyprint-override"><code>end_res = []
cur_seq = [maxTime[0]]
for num in maxTime[1:]:
if num == cur_seq[-1] + 1:
cur_seq.append(num)
else:
end_res.append(cur_seq)
cur_seq = [num]
end_res.append(cur_seq)
</code></pre>
<p>根据您希望如何准确地使用结果,这只是像您的示例一样打印它:</p>
<pre class="lang-py prettyprint-override"><code>print(end_res)
for res in end_res:
if len(res) > 1:
print(res[0], ':', res[-1], sep='')
else:
print(res[0])
</code></pre>
<p>在<code>maxTime</code>列表中,您给出了<code>[6, 7, 8, 10]</code>,它给出了:</p>
<pre><code>[[6, 7, 8], [10]]
6:8
10
</code></pre>