Reorder List

Given a singly linked list L: L₀→L₁→…→L_n-1→L_n,
reorder it to: L₀→L_n→L₁→L_n-1→L₂→L_n-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 (!head || !head->next)
			return;
		ListNode *current = head, *rehead = head, *temp = NULL, *precurrent = NULL;
		int length = 1,count=1;
		while (rehead->next)
		{
			rehead = rehead->next;
			++length;
		}
		while (count <length / 2)
		{
			++count;
			current = current->next;
		}
		if (length % 2)
			current = current->next;
		rehead = current;
		precurrent = current->next;
		current = current->next->next;
		while (current)
		{
			temp = rehead->next;
			precurrent->next = current->next;
			rehead->next = current;
			current->next = temp;
			current = precurrent->next;
		}
		current = rehead;
		rehead = rehead->next;
		current->next = NULL;
		current = head;
		while (current&&rehead)
		{
			temp = rehead->next;
			rehead->next = current->next;
			current->next = rehead;
			current = rehead->next;
			rehead = temp;
		}
	}
};