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}.

算法思路是进行三次遍历，第一次遍历确定中间节点slow，第二次遍历后半段将后半段链表逆转，第三次从首向前，从尾向后同时遍历。

/**
 * 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==NULL || head->next==NULL || head->next->next==NULL) return;
        
        ListNode *slow=head,*fast=head;
        while(fast->next && fast->next->next){
            slow = slow->next;
            fast = fast->next->next;
        }
       
        ListNode *p = slow->next, *pp = slow, *sp = p->next;
        slow->next = NULL;
         //逆转后半段链表
        while(p!=NULL){
            p->next = pp;
            pp = p;
            p = sp;
            if(sp) sp = sp->next;
        }
        
        p = head;
        while(pp!=slow){
            sp = pp->next;
            pp->next = p->next;
            p->next = pp;
            p = p->next->next;
            pp = sp;
        }
        
    }
};