LeetCode "Odd Even Linked List"

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

        ListNode *pOddHead = head, *pEvenHead = head->next;
        ListNode *pOddTail = pOddHead, *pEvenTail = pEvenHead;
        ListNode *pOddLast = pOddTail;

        while (pOddTail)
        {
            ListNode *pNxtOdd = pOddTail->next ? pOddTail->next->next : nullptr;
            ListNode *pNxtEven = (!pEvenTail || !pEvenTail->next) ? nullptr : pEvenTail->next->next;
            
            pOddTail->next = pNxtOdd;
            if(pEvenTail) pEvenTail->next = pNxtEven;
            
            pOddLast = pOddTail;
            pOddTail = pNxtOdd;
            pEvenTail = pNxtEven;
        }
        pOddLast->next = pEvenHead;

        return pOddHead;
    }
};