LeetCode 143. 重排链表

题目描述：

解法：

/**
 * 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) return;
        int size = 1;
        ListNode* vhead = head;
        while (vhead->next != NULL) {
            size++;
            vhead = vhead->next;
        }
        size = size % 2 ? (size / 2 + 1) : size / 2;        //找到中间位置
        vhead = head;
        while (--size)   vhead = vhead->next;
        ListNode* pre = vhead; vhead = vhead->next;        //断链，分别处理
        pre->next = NULL; pre = NULL;
        ListNode* temp;
        while (vhead->next != NULL) {                      //第二条链反转
            temp = vhead->next;
            vhead->next = pre;
            pre = vhead;
            vhead = temp;
        }
        vhead->next = pre;
        pre = head;
        while (pre != NULL&&vhead != NULL) {              //两条链交合
            temp = pre->next;
            pre->next = vhead;
            pre = temp;
            temp = vhead->next;
            vhead->next = pre;
            vhead = temp;
        }
    }
};