LeetCode 24. Swap Nodes in Pairs递归解法 C++

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 may be changed.
给定一个链表，两两交换其中相邻的节点，并返回交换后的链表。
你不能只是单纯的改变节点内部的值，而是需要实际的进行节点交换。

Example:

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

C++

//example 1->2->3
class Solution {
public:
    ListNode* swapPairs(ListNode* head) {
    	if(head == nullptr) return NULL;
    	if(head->next == nullptr) return head;
    	//2 is newhead, 1 is head.
		ListNode* newhead = head->next;
		//3 is third.
    	ListNode* third = head->next->next;
		//2->1
    	newhead->next = head;
		//1->3
		head->next = swapPairs(third);
		return newhead;
    }
};

参考:Simple implementation with C++