leetcode_odd_even_linked_list

/**
 * 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) {
        ListNode *odd_dummy = new ListNode(1);
        ListNode *even_dummy = new ListNode(2);
        ListNode *odd_cur = odd_dummy;
        ListNode *even_cur = even_dummy;
        ListNode *cur = head;
        int count = 1;
        while(cur != NULL)
        {
            if(count++ % 2 == 1)
            {
                odd_cur->next = cur;
                cur = cur->next;
                odd_cur = odd_cur->next;
                odd_cur->next = NULL;
            }
            else
            {
                even_cur->next = cur;
                cur = cur->next;
                even_cur = even_cur->next;
                even_cur->next = NULL;
                
            }
        }
        odd_cur->next = even_dummy->next;
        return odd_dummy->next;
    }
};