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 ...
题意:将奇数结点,偶数结点左右分开,是结点号不是结点值。
解法:建一个head2当作偶数链表的头,然后head,head2你连我,我连你,就分开两个链表,最后两个链表再一连。
/**
* 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) return head;
ListNode *head2 = head->next;
ListNode *p1 = head, *p2 = head2;
while(p1->next && p2->next){
p1->next = p2->next;
p1 = p1->next;
p2->next = p1->next;
p2 = p2->next;
}
p1->next = head2;
return head;
}
};