1 题目
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 1:
Input: 1->2->3->4->5->NULL
Output: 1->3->5->2->4->NULL
Example 2:
Input: 2->1->3->5->6->4->7->NULL
Output: 2->3->6->7->1->5->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 ...
2 尝试解
2.1 分析
用两个指针odd_tail和even_tail分别指向已维护好的前半部分奇数链表和后半部分偶数链表的末尾,初始时分别指向第一个和第二个节点,然后每次维护会加入even_tail后的两个节点,分别添加到odd_tail和even_tail的末尾。
2.2 代码
class Solution {
public:
ListNode* oddEvenList(ListNode* head) {
if(!head || !head->next || !head->next->next) return head;
ListNode* odd_tail = head;
ListNode* even_tail = head->next;
while(1){
ListNode* split = odd_tail->next;
odd_tail->next = even_tail->next;
even_tail->next = odd_tail->next->next;
odd_tail->next->next = split;
odd_tail = odd_tail->next;
if(even_tail->next && even_tail->next->next) even_tail = even_tail->next;
else break;
}
return head;
}
};
3 标准解
class Solution {
public:
ListNode* oddEvenList(ListNode* head)
{
if(!head) return head;
ListNode *odd=head, *evenhead=head->next, *even = evenhead;
while(even && even->next)
{
odd->next = odd->next->next;
even->next = even->next->next;
odd = odd->next;
even = even->next;
}
odd->next = evenhead;
return head;
}
};