每日一道Leetcode——奇偶链表

题目：

我的解法：
拆分奇偶链表，把偶链表连接到奇链表之后。

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode oddEvenList(ListNode head) {
        if(head==null){
            return head;
        }
        ListNode odd_head = head;
        ListNode even_head = head.next;
        ListNode odd_dummy = odd_head;
        ListNode even_dummy = even_head;
        while(odd_head.next!=null && even_head.next!=null){
            odd_head.next = even_head.next;
            odd_head = odd_head.next;
            even_head.next = odd_head.next;
            even_head = even_head.next;
        }
        odd_head.next = even_dummy;
        return odd_dummy;
    }
}

官方题解：

class Solution {
    public ListNode oddEvenList(ListNode head) {
        if (head == null) {
            return head;
        }
        ListNode evenHead = head.next;
        ListNode odd = head, even = evenHead;
        while (even != null && even.next != null) {
            odd.next = even.next;
            odd = odd.next;
            even.next = odd.next;
            even = even.next;
        }
        odd.next = evenHead;
        return head;
    }
}

作者：LeetCode-Solution
链接：https://leetcode-cn.com/problems/odd-even-linked-list/solution/qi-ou-lian-biao-by-leetcode-solution/
来源：力扣（LeetCode）
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。