/**
* 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* node1 = head;
ListNode* head2 = head->next;
ListNode* node2 = head2;
while(node1->next && node2->next){
node1->next = node2->next;
node1 = node1->next;
node2->next = node1->next;
node2 = node2->next;
}
if(node2 && node2->next){
node1->next = node2->next;
node1 = node1->next;
}
node1->next = head2;
return head;
}
};
328. 奇偶链表/C++
最新推荐文章于 2024-02-21 09:16:40 发布