Skip to content

Files

24-swap-nodes-in-pairs

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
Oct 14, 2022
Oct 14, 2022
Oct 14, 2022

Medium


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