【leetcode】143. Reorder List

题目：

---

思路：
思路很简单，用一个双端队列将所有node都保存起来。然后，从头部取出一个node，从尾部取出一个node，从头取出一个node，从尾部取出一个node······直到双端队列为空为止。

---

代码实现：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    void reorderList(ListNode* head) {
        if (head == nullptr || head->next == nullptr){
            return ;
        }
        deque<ListNode*> dq;
        ListNode *p = head->next;
        while (p){
            dq.push_back(p);
            p = p->next;
        }
        p = head;        
        bool flag = false;
        while (!dq.empty()){
            if (flag){
                ListNode *t = dq.front();
                dq.pop_front();
                p->next = t;
            }else{
                ListNode *t = dq.back();
                dq.pop_back();
                p->next = t;
            }
            flag = 1 - flag;
            p = p->next;
        }
        p->next = nullptr;
    }
};

discuss:
思路：将链表的后半段反转，然后merge到前半段中。

class Solution {
public:
    void reorderList(ListNode* head) {
        if (!head || !head->next) return ;
        
        ListNode *p1 = head;
        ListNode *p2 = head;
        
        while (p2->next != NULL && p2->next->next != NULL){
            p1 = p1->next;
            p2 = p2->next->next;
        }
        
        // p1指向中点
        
        ListNode *preMiddle = p1; // preMiddle本身是不动的，ta始终指向中间节点
        ListNode *preCurrent = p1->next;
        
        // 将后半段反转
        while (preCurrent->next != NULL){
            ListNode *current = preCurrent->next;
            preCurrent->next = current->next;
            current->next = preMiddle->next;
            preMiddle->next = current;
        }
        
        // 剩下的就是merge到一起即可（后半段merge到前半段）。
        p1 = head;
        p2 = preMiddle->next;
        while (p1 != preMiddle){
            preMiddle->next = p2->next;
            p2->next = p1->next;
            p1->next = p2;
            p1 = p2->next;
            p2 = preMiddle->next;
        }
        
        
    }

};