擅长:python、mysql、java
<p>一种经常被忽视的处理非常长的行的方法是将它们分成更多、更短的行:</p>
<pre><code>q_overlaps = next_qi < qi + lcs_len # If the next qLCS overlaps
r_start_overlaps = next_ri < ri + lcs_len # If the next rLCS start overlaps
r_end_overlaps = next_ri + lcs_len > ri # If the next rLCS end overlaps
if q_overlaps and r_start_overlaps and r_end_overlaps:
del candidate_lcs[qi] # Delete dupilicate LCS.
</code></pre>