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.

题目分析：

1、边界情况：链表为空或者链表长度为1

2、将链表分成两个小链表，一个为奇数位节点，一个为偶数位节点，最终将奇数位的最后一个节点指向偶数位的第一个节点

思路：

1、判断边界情况

2、设置两个指针分别指向第一个和第二个指针，并备份这两个节点。

3、根据链表长度为奇数或者偶数，合理设置循环条件

代码：

/**
 * 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 == nullptr || head->next == nullptr)   return head;
        ListNode* odd = head;
        ListNode* even = head->next;
        ListNode* oriodd = odd;
        ListNode* orieven = even;
        while (even != nullptr && even->next != nullptr){
            odd->next = even->next;
            odd = odd->next;
            even->next = odd->next;
            even = even->next;
        }
        odd->next = orieven;
        return oriodd;
    }
};

注：看讨论区发现我的思路和大家普遍推崇的方法很类似，哈哈，继续加油。