Linked List
143. Reorder List
Weave the list into L0→Ln→L1→Ln-1→… — front node, back node, front, back — rewiring pointers only, no value swaps. Trying to reach "the back node" repeatedly on a singly-linked list is the pain…
Loading…
Weave the list into L0→Ln→L1→Ln-1→… — front node, back node, front, back — rewiring pointers only, no value swaps. Trying to reach "the back node" repeatedly on a singly-linked list is the pain…
Loading…