Anonymous user
Longest increasing subsequence: Difference between revisions
m
→{{header|Java}}
(→Python: Patience sorting method: improved) |
|||
Line 301:
// extract LIS from nodes
List<E> result = new ArrayList<E>();
for (Node<E> node =
node != null; node = node.pointer)
result.add(node.value);
Collections.reverse(result);
| |||