Pairwise Linked List Swap
Given a singly linked list node
, swap each pair of nodes and return the new head.
Constraints
n ≤ 100,000
wheren
is the number of nodes innode
https://binarysearch.com/problems/Pairwise-Linked-List-Swap
Examples
Example 1
Input
- node =
Output
- answer =
Example 2
Input
- node =
Output
- answer =
Leave a comment