328. Odd Even Linked List leetcode(list)

1. Odd Even Linked List
   Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.

You should try to do it in place. The program should run in O(1) space complexity and O(nodes) time complexity.

Example:
Given 1->2->3->4->5->NULL,
return 1->3->5->2->4->NULL.

Note:
The relative order inside both the even and odd groups should remain as it was in the input.
The first node is considered odd, the second node even and so on …

ListNode* oddEvenList(ListNode* head) {
        //注意本题的意思是将序号为偶数的节点移至链表的后部分，将序号为奇数的节点移至链表的首部
        //如果链表为空，或者链表只有一个节点，或者链表只有两个节点则返回原链表
        if(NULL == head || NULL == head->next || NULL == head->next->next)
        {
            return head;
        }

        //思路：把奇数连接起来，偶数连接起来，最后连接奇偶。
        ListNode* oddList = head; //oddList其实保存的是奇数链表的最后一个节点
        ListNode* evenList = head->next;//evenList保存的是偶数链表的最后一个节点
        ListNode* evenHead = head->next; //用来保存偶数链表的表头

        while(oddList->next && evenList->next)
        {
            oddList->next = evenList->next;
            evenList->next = evenList->next->next;
            oddList = oddList->next;
            evenList = evenList->next;
        }

        oddList->next = evenHead;//将奇偶链表连接起来
        return head;
    }