[leetcode][list] Reorder List

题目：

Given a singly linked list L: L0→L1→…→Ln-1→Ln,
reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…

You must do this in-place without altering the nodes' values.

For example,
Given {1,2,3,4}, reorder it to {1,4,2,3}.

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
   void reorderList(ListNode* head) {
	if (NULL == head || NULL == head->next || NULL == head->next->next) return;
	//快慢指针找到中间节点
	ListNode *slow = head, *fast = head;
	while (fast != NULL && fast->next != NULL) {
		slow = slow->next;
		fast = fast->next->next;
	}
	ListNode *p = slow->next;
	slow->next = NULL;
	//翻转后半部分
	ListNode *headSecond = reverseList(p);
	//合并两部分
	ListNode *p1 = head->next, *p2 = headSecond->next;
	ListNode *tail = headSecond;
	head->next = headSecond;
	while (p2 != NULL){
		tail->next = p1;
		ListNode *p = p1->next;
		p1->next = p2;
		tail = p2;
		p1 = p;
		p2 = p2->next;
	}
	if (p1 != NULL) tail->next = p1;//节点个数可能是奇数，要把最中间的节点连入新链表
}
private:
//翻转链表的递归实现
ListNode *reverseListCore(ListNode *head, ListNode *next){
	if (NULL == head) return NULL;
	ListNode *p = head->next;
	head->next = next;
	//注意递归结束条件是head是最后一个节点，连入next之后返回该节点即为整个链表的第一个节点
	return p == NULL ? head : reverseListCore(p, head);
}
ListNode *reverseList(ListNode *head){
	if (NULL == head || NULL == head->next) return head;
	return reverseListCore(head, NULL);
}
};