Longest increasing subsequence: Difference between revisions

Content added Content deleted
(Less flexible D entry)
(Simpler D entry)
Line 24: Line 24:


static struct Node { T val; Node* back; }
static struct Node { T val; Node* back; }
auto pile = [[new Node(items[0], null)]];
auto pile = [[new Node(items[0])]];


OUTER: foreach (immutable di; items[1 .. $]) {
OUTER: foreach (immutable di; items[1 .. $]) {