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 ...
这道题是按单双号重排链表中节点,题目难度为Medium。
假设链表前四个节点分别为n0、n1、n2和n3,记录下偶数节点的头节点,即n1,之后将n0->next置为n2,n1->next置为n3,遍历后序节点继续上述操作即可完成链表的重排,最后将偶数节点的头节点(n1)接到奇数节点的尾部即可。具体代码:
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* oddEvenList(ListNode* head) {
if(!head) return NULL;
ListNode *eHead = head->next;
ListNode *odd = head, *even = head->next;
while(even && even->next) {
odd->next = even->next;
odd = odd->next;
even->next = odd->next;
even = even->next;
}
odd->next = eHead;
return head;
}
};