328. Odd Even Linked List

算蠻基本的list操作,

稍微紙筆推倒一下即可

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* oddEvenList(ListNode* head) {
        ListNode *odd = head;
        if(!head || !head->next) return head;
        ListNode *even = head->next;
        ListNode *even_start = even;
        while(even && even->next){
            odd->next = even->next;
            even->next = odd->next->next;
            odd = odd->next;
            even = even->next;
        }
        odd->next = even_start;
        return head;
        
    }
};