22 7 月, 2021

Last Updated on 2022-02-16 by Clay

題目

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.)