C++ leetcode 328. Odd Even Linked List CHATGPT UNLIMITED

class Solution {
public:
    ListNode* oddEvenList(ListNode* head) {
        if (!head || !head->next) {
            return head;
        }

        ListNode* odd = head;
        ListNode* even = head->next;
        ListNode* evenHead = even;

        while (even != nullptr && even->next != nullptr) {
            odd->next = even->next;
            odd = odd->next;
            even->next = odd->next;
            even = even->next;
        }

        odd->next = evenHead;

        return head;
    }
};


In this implementation, the `oddEvenList` function rearranges the linked list by separating the odd-indexed nodes from the even-indexed nodes and then merging them back together. The function returns the head of the modified linked list.