Leetcode Problem 143. Reorder List
Leetcode Solutions
Reorder Linked List by Reversing Second Half and Merging
- Use two pointers,
slowandfast, to find the middle of the linked list. - Reverse the second half of the linked list starting from the node right after the middle node.
- Merge the two halves of the list by alternating nodes from each half.
Reorder Linked List by Splitting, Reversing, and Merging
Ask Question
Programming Language
Purpose:
image/screenshot of info(optional)
Full Screen
Loading...
Suggested Answer
Answer
Code Diffs Compare
Full Screen
Copy Answer Code
Loading...
OR