Longest common subsequence: Difference between revisions
m
Replaced use of chains.size() with chains.empty().
(Removed unnecessary it1->empty() optimization.) |
m (Replaced use of chains.size() with chains.empty().) |
||
Line 601:
if (traceLCS) {
// Return the LCS as a linked list of matched index pairs:
auto last = chains.
// Reverse longest chain
*pairs = Pair::Reverse(last);
| |||