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

-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

这道题是leetcode的easy题目，解法也很简单，希望和大家分享一下。 基本上就two pointers. 一个用于连接所有的偶数nodes， 一个用于连接所有的基数nodes。最后把尾he头接上就好啦~~

class Solution {
public:
    ListNode* oddEvenList(ListNode* head) {
        if(head == nullptr || head->next == nullptr) // If linkedList contains less than 2 nodes, return head
          return head;
        ListNode* first = head;
        ListNode* second = head->next;
        ListNode* temp = second;
        while(second && second->next){ // 每次偶数的list连接一个偶数node，基数list也连接一个基数node。
            first->next = second->next;
            first = first->next;
            second->next = first->next;
            second = second->next;
        }
        first->next = temp; //尾部和头部相连
        return head;
    }
};