Leetcode17——328.奇偶链表

定一个flag判断奇偶+奇偶链表指针，最后两链表合并即可

class Solution {
public:
    ListNode* oddEvenList(ListNode* head){
          if(head==NULL||head->next==NULL||head->next->next==NULL)return head;

           ListNode *odd=head,*even=head->next;
           ListNode *oddhead=head,*evenhead=head->next;
           ListNode *cur=head->next->next;
           //为true表示为奇数个，false为偶数个
           bool flag=true;

           while(cur!=NULL){
                if(flag){
                    odd->next=cur;
                    odd=cur;
                    //printf("odd=%d\n",odd->val);
                }else{
                   even->next=cur;
                   even=cur;
                   
                }
                cur=cur->next;
                flag=!flag;
           }

           odd->next=evenhead;
           even->next=NULL;
           
       
           return oddhead;

    }
};