C++程序将链表中的偶数节点和奇数节点分离

什么是链表

在计算机科学中，链表是一种线性数据结构，其中元素的线性顺序不是由它们在内存中的物理位置给出的，而是每个元素存储了下一个元素的地址。链表数据结构允许插入和移除表上任意位置的节点，这使得链表在某些应用上比数组更具优势。

如何将链表中的偶数节点和奇数节点分离

下面是将链表中的偶数节点和奇数节点分离的C++代码示例：

#include<iostream>
using namespace std;

struct ListNode {
    int val;
    ListNode *next;
    ListNode(int x) : val(x), next(NULL) {}
};

class Solution {
public:
    ListNode* oddEvenList(ListNode* head) {
        if(head == NULL || head -> next == NULL || head -> next -> next==NULL) {
            return head;
        }
        ListNode* odd = head;
        ListNode* even = head -> next;
        ListNode* evenHead = even;
        while(even != NULL && even -> next != NULL) {
            odd -> next = even -> next;
            odd = odd -> next;
            even -> next = odd -> next;
            even = even -> next;
        }
        odd -> next = evenHead;
        return head;
    }
};

int main() {
    ListNode* node1 = new ListNode(1);
    ListNode* node2 = new ListNode(2);
    ListNode* node3 = new ListNode(3);
    ListNode* node4 = new ListNode(4);
    ListNode* node5 = new ListNode(5);
    ListNode* node6 = new ListNode(6);
    node1 -> next = node2;
    node2 -> next = node3;
    node3 -> next = node4;
    node4 -> next = node5;
    node5 -> next = node6;
    Solution solution;
    ListNode* head = solution.oddEvenList(node1);
    while(head != NULL) {
        cout<<head -> val<<" ";
        head = head -> next;
    }
    return 0;
}