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 ...
大水题啊又是,思路就是把odd的和even的各自连起来,再把奇的偶的两个链接起来即可。
/**
* 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) {
ListNode* p=head;
ListNode* headeven=NULL;
ListNode* temp;
if(p==NULL||p->next==NULL||p->next->next==NULL)
return head;
while (p->next!=NULL)
{
temp=p->next;
if(temp->next!=NULL){
p->next=temp->next;
temp->next=temp->next->next;
if(headeven==NULL)
headeven=temp;
p=p->next;
}
else
break;
}
p->next=headeven;
return head;
}
};