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 ...
开始我还以为数是随机给的,就先判断元素的奇偶再排进来,果然超时。
改了下,代码贴上
/**
* 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) || (!head->next))
return head;
ListNode* oddHead = head;
ListNode* evenHead = head->next;
ListNode* pOdd = oddHead, *pEven = evenHead;
while (pOdd->next && pEven->next)
{
pOdd->next = pEven->next;
pOdd = pOdd->next;
pEven->next = pOdd->next;
pEven = pEven->next;
}
pOdd->next = evenHead;
return oddHead;
}
};