LeetCode *** 143. 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 *slow = head, *fast = head->next;

		 while (fast && fast->next) {
			 slow = slow->next;
			 fast = fast->next->next;
		 }

		 ListNode *mid = slow->next;
		 fast = mid->next, mid->next = NULL, slow->next = NULL;

		 while (fast) {
			 slow = fast->next;
			 fast->next = mid;
			 mid = fast;
			 fast = slow;
		 }

		 for (slow = head, fast = mid; slow;) {
			 ListNode *tmp = slow->next;
			 slow->next = fast;
			 slow = slow->next;
			 fast = tmp;
		 }
	 }
 };