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 *pre = head, *cur = head->next;
while (cur && cur -> next) {
ListNode *tmp = pre->next;
pre->next = cur->next;
pre = pre->next;
cur->next = pre->next;
pre->next = tmp;
cur = cur->next;
}
return head;
}
};