题解 | #链表的奇偶重排#
链表的奇偶重排
https://www.nowcoder.com/practice/02bf49ea45cd486daa031614f9bd6fc3
一种简单思路
package main import . "nc_tools" /* * type ListNode struct{ * Val int * Next *ListNode * } */ /** * 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 * * * @param head ListNode类 * @return ListNode类 */ func oddEvenList(head *ListNode) *ListNode { if head == nil { return nil } odd := &ListNode{} even := &ListNode{} tmp := even ans := odd n := 1 for head != nil { if n%2 == 1 { odd.Next = &ListNode{Val: head.Val} odd = odd.Next } else { even.Next = &ListNode{Val: head.Val} even = even.Next } head = head.Next n++ } odd.Next = tmp.Next return ans.Next }