【leetcode】奇偶链表/双指针
leetcode极简笔记,主要记录自己写的辣鸡代码
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* oddEvenList(ListNode* head) {
//链表长度为0或1或2
if(!head || !head->next || !head->next->next) return head;
ListNode *left=head,*right=head->next,*head2=head->next;
while(left || right){
left->next=right->next;
if(!left->next) break;
left=left->next;
right->next=left->next;
if(!right->next) break;
right=right->next;
}
left->next=head2;
return head;
}
};