leetcode-328-奇偶链表

ChenD17

于 2020-06-23 14:27:42 发布

阅读量159

点赞数

分类专栏：链表 leetcode备份-中等

本文链接：https://blog.csdn.net/ChenD17/article/details/104103959

版权

leetcode备份-中等同时被 2 个专栏收录

49 篇文章 0 订阅

订阅专栏

链表

12 篇文章 0 订阅

订阅专栏

class Solution {
public:
   ListNode* oddEvenList(ListNode* head) {
       if (head == NULL || head->next == NULL) return head;
       int cnt = 1;
       ListNode* mid = head;
       ListNode* curNode = head->next;
       while (curNode!= NULL && curNode->next != NULL) {
           ListNode *next = curNode->next;
           curNode->next = next->next;
           next->next = mid->next;
           mid->next = next;
           mid = next;
           curNode = curNode->next;
       }
       return head;
   }
};

int main()
{
   Solution sol;
   vector<int> input = {1,2,3,4,5,6,7,8};
   ListNode *head = createListNode(input);
   printLinkedList(sol.oddEvenList(head));
   return 0;
}