| Excerpt |
|---|
Given a linked list, swap every two adjacent nodes and return its head. |
Example:
Given 1->2->3->4, you should return the list as 2->1->4->3.
Note:
...
Page History
Overview
Content Tools
| Excerpt |
|---|
Given a linked list, swap every two adjacent nodes and return its head. |
Example:
Given 1->2->3->4, you should return the list as 2->1->4->3.
Note:
...