Reorder List

O(n) complexity and O(1) space

A linked list reverse function included.

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* reverse(ListNode *head) {
        if (head==NULL || head->next==NULL) return head;
        ListNode *pre=new ListNode(0);
        pre->next=head;
        ListNode *cur=pre->next, *nex=cur->next;
        while(nex) {
            cur->next = nex->next;
            nex->next = pre->next;
            pre->next=nex;
            nex=cur->next;
        }
        return pre->next;
    }
    void reorderList(ListNode *head) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        if (!head) return;
        ListNode *l1=head, *l2=head;
        while(l1 && l1->next) {
            l1=l1->next->next;
            l2=l2->next;
        }
        ListNode *rest=reverse(l2->next);
        ListNode *first=head;
        l2->next = NULL;
        while(first && rest) {
            ListNode *tmp=rest->next;
            rest->next = first->next;
            first->next = rest;
            rest = tmp;
            first = first->next->next;
        }
        
    }
};