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 ...
主要思路:
不过需要注意的是边界条件,当p2在前时,要判断p2->next,当p1在前时要判断p1->next,代码如下
/**
* 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==NULL || head->next==NULL)
return head;
ListNode* L1 = head;
ListNode* L2 = head->next;
ListNode* P1 = L1;
ListNode* P2 = L2;
while(P1 && P2)
{
if(P2->next==NULL)
{
P1->next = L2;
break;
}
P1->next = P2->next;
P1 = P1->next;
if(P1->next==NULL)
{
P1->next = L2;
P2->next = NULL;
break;
}
P2->next = P1->next;
P2 = P2->next;
}
return L1;
}
};