328. 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 ...

分析

首先判断多于三个结点才会进行遍历操作。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* oddEvenList(ListNode* head) {
        if(head==NULL||head->next==NULL||head->next->next==NULL)
            return head;
        ListNode* odd_head=head;//保存奇数位的头结点
        ListNode* even_head=head->next;//保存偶数位的头结点
        ListNode* temp_head=head;//偶数位的遍历头指针
        while(head->next!=NULL&&temp_head->next!=NULL)//当奇数位和偶数位任一都未到尾部时进行循环
        {
            temp_head=head->next;//偶数位移到当前偶数列的尾部
            head->next=temp_head->next;
            if(head->next!=NULL)//当奇数列未到尾部时才会将head后移，否则后移之后找不到奇数列的尾部
                head=head->next;
            temp_head->next=head->next;//将奇数列的下一个结点加到偶数列之后，在循环中判断当前是否是尾部
        }
        head->next=even_head;//奇数列与偶数列衔接
        return odd_head;//返回头指针
    }
};