Skip to content

Latest commit

 

History

History
13 lines (10 loc) · 325 Bytes

README.md

File metadata and controls

13 lines (10 loc) · 325 Bytes

Problem

Given a singly linked list L: L0→L1→…→Ln-1→Ln, reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…

You must do this in-place without altering the nodes' values.

For example,
Given {1,2,3,4}, reorder it to {1,4,2,3}.

Solution

Split list in two, reverse second part, and interleave the two parts