2023-2-17 链表的奇偶重排

/**
 * struct ListNode {
 *	int val;
 *	struct ListNode *next;
 *	ListNode(int x) : val(x), next(nullptr) {}
 * };
 */
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param head ListNode类 
     * @return ListNode类
     */
    ListNode* oddEvenList(ListNode* head) {
        //长度 <= 2的就别排序了
        if (!head || !head->next || !head->next->next) {
            return head;
        }
        // write code here
        ListNode* odd = head;
        ListNode* evenHead = head->next;
        ListNode* even = evenHead;
        ListNode* oddTail = nullptr;
        while (odd && even) {
            odd->next = even->next;
            odd = odd->next;
            if (odd) {
                even->next = odd->next;
                oddTail = odd;
            }
            even = even->next;
        }
        oddTail->next = evenHead;
        return head;
    }
};