0024-swap-nodes-in-pairs.adoc

24. Swap Nodes in Pairs

{leetcode}/problems/swap-nodes-in-pairs/[LeetCode - Swap Nodes in Pairs^]

Given a linked list, swap every two adjacent nodes and return its head.

You may not modify the values in the list’s nodes, only nodes itself may be changed.

Example:

Given 1->2->3->4, you should return the list as 2->1->4->3.

思考题

尝试使用递归来实现一下。

参考资料

1. 两两交换链表中的节点 - 两两交换链表中的节点 - 力扣（LeetCode）

Given a linked list, swap every two adjacent nodes and return its head.

You may not modify the values in the list’s nodes, only nodes itself may be changed.

Example:

Given 1->2->3->4, you should return the list as 2->1->4->3.

link:{sourcedir}/_0024_SwapNodesInPairs.java[role=include]