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

package main
import . "nc_tools"
/*
 * type ListNode struct{
 *   Val int
 *   Next *ListNode
 * }
 */

/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 * 
 * @param head ListNode类 
 * @return ListNode类
*/
func oddEvenList( head *ListNode ) *ListNode {
    // write code here
    if head == nil || head.Next == nil || head.Next.Next == nil{
        return head
    }
    
    jHead , oHead := &ListNode{},&ListNode{}
    j,o := jHead,oHead
    
    for head != nil && head.Next != nil{
        j.Next = head
        o.Next = head.Next
        
        j = j.Next
        o = o.Next
        
        head = head.Next.Next
    }
    
    if head != nil {
        j.Next = head
        j = j.Next
    }
    
    o.Next = nil 
    
    j.Next = oHead.Next
    return jHead.Next
    
}