LeetCode 24. Swap Nodes in Pairs - 链表（Linked List）系列题5

Given a linked list, swap every two adjacent nodes and return its head. You must solve the problem without modifying the values in the list's nodes (i.e., only nodes themselves may be changed.)

Example 1:

Input: head = [1,2,3,4]
Output: [2,1,4,3]

Example 2:

Input: head = []
Output: []

Example 3:

Input: head = [1]
Output: [1]

Constraints:

• The number of nodes in the list is in the range [0, 100].
• 0 <= Node.val <= 100

题目大意：给定一个链表，要求把相邻的节点两两互换位置。是互换节点而不是改变节点值。

本题可以用递归和迭代两种解法。

解法1