[LeetCode] 24. Swap Nodes in Pairs

轉自LeetCode

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

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

Your algorithm should use only constant space. You may not modify the values in the list, only nodes itself can be changed.

<Solution>

這題不難，但需要畫一下圖來釐清怎麼變換指標

配合圖，應該就可以寫得出來

code 如下
c++

kotlin