# 328. Odd Even Linked List

Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.

You should try to do it in place. The program should run in O(1) space complexity and O(nodes) time complexity.

Example:
Given 1->2->3->4->5->NULL,
return 1->3->5->2->4->NULL.

Note:
The relative order inside both the even and odd groups should remain as it was in the input.
The first node is considered odd, the second node even and so on …

Credits:
Special thanks to @DjangoUnchained for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

/**
* public class ListNode {
*     int val;
*     ListNode next;
*     ListNode(int x) { val = x; }
* }
*/
public class Solution {

return null;
}

ListNode odd = new ListNode(0);
ListNode oddCurr = odd;
ListNode even = new ListNode(0);
ListNode evenCurr = even;
int counter = 0;
while(tmp != null){

counter ++;
if(counter % 2 == 1){

oddCurr.next = new ListNode(tmp.val);
oddCurr = oddCurr.next;
}else{

evenCurr.next = new ListNode(tmp.val);
evenCurr = evenCurr.next;
}
tmp = tmp.next;
}

oddCurr.next = even.next;

return odd.next;

}
}
• 本文已收录于以下专栏：

举报原因： 您举报文章：328. Odd Even Linked List 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)