题解 | #链表的奇偶重排#
链表的奇偶重排
https://www.nowcoder.com/practice/02bf49ea45cd486daa031614f9bd6fc3
/*
* function ListNode(x){
* this.val = x;
* this.next = null;
* }
*/
/**
* 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
*
*
* @param head ListNode类
* @return ListNode类
*/
function oddEvenList( head ) {
// write code here
if(head==null) return null
var oddList=head,evenList=head.next;
var odd=oddList,even=evenList;
while(even!=null && even.next!=null){
odd.next=even.next
odd=odd.next;
even.next=odd.next
even=even.next;
}
odd.next=evenList
return oddList
}
module.exports = {
oddEvenList : oddEvenList
};
* function ListNode(x){
* this.val = x;
* this.next = null;
* }
*/
/**
* 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
*
*
* @param head ListNode类
* @return ListNode类
*/
function oddEvenList( head ) {
// write code here
if(head==null) return null
var oddList=head,evenList=head.next;
var odd=oddList,even=evenList;
while(even!=null && even.next!=null){
odd.next=even.next
odd=odd.next;
even.next=odd.next
even=even.next;
}
odd.next=evenList
return oddList
}
module.exports = {
oddEvenList : oddEvenList
};
小鹏汽车AI面26人在聊