题解 | #链表的奇偶重排#

/*
 * function ListNode(x){
 *   this.val = x;
 *   this.next = null;
 * }
 */
/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 * 
 * @param head ListNode类 
 * @return ListNode类
 */
function oddEvenList( head ) {
    let odd=[],even=[],n=true
    while(head){
        if(n){
            odd.push(head)
        }else{
            even.push(head)
        }
        n=!n
        head=head.next
    }
    let newHead=odd.shift();
    let tail=newHead
    while(odd.length){
        tail.next=odd.shift()
        tail=tail.next
        if(odd.length===0)tail.next=null
    }
    while(even.length){
          tail.next=even.shift()
        tail=tail.next
        if(even.length===0)tail.next=null

    }
    return newHead
    // write code here
}
module.exports = {
    oddEvenList : oddEvenList
};