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
...
即使是拖后腿的,拼死努力的话,也是可以超越精英的。