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 …

---

审题

给一个单链表，让所有的偶数节点排在基数节点之后。标记的是节点数，而不是节点值！不是节点值！不是节点值！重要的事情说三遍。

新建两个表，将节点为奇数的加入到一个，把节点为偶数的加入到一个，然后将两个表连起来！

遇到的问题：
1.需要一些判断条件，节点为空时，返回空；节点只有一个时返回head;节点只有两个的时候只有节点一和节点二，因此也返回head.
2.在新建表的时候，给一个初始节点，然后最后再去掉；
3.当链表为奇数是，最后的表二head2在结束后，一定要将其元素在最后删除。

---

源码

/**
 * 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) return NULL;
        else if(head->next==NULL) return head;
        else if(head->next->next==NULL) return head;


        ListNode* head1=new ListNode(1);
        ListNode* head2=new ListNode(2);
        ListNode* res=head1;
        ListNode* temp=head2;
        int i=1;
        while(head!=NULL){
            if(i%2==1){
                head1->next=head;
                head1=head1->next;
            }else{
                head2->next=head;
                head2=head2->next;
            }
            head=head->next;
            i++;
        }
        head2->next=NULL;
        head1->next=temp->next;
        return res->next;

    }
};