链表算法

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) {
        stack<ListNode *> sk;
        ListNode *p = head;
        while(p){
            sk.push(p);
            p = p->next;
        }
        p = head;
        while(p && p->next &&p->next->next){
            ListNode *q = sk.top();
            sk.pop();
            ListNode * p_next = p->next;
            p->next = q;
            q->next = p_next;
            sk.top()->next = NULL;
            p = p->next->next;
        }
    }
};