c_cpp 交替拆分给定的单链表

Posted 2021-05-14

// https://www.geeksforgeeks.org/alternating-split-of-a-given-singly-linked-list/
#include <iostream>
#include <list>
using namespace std;

struct linked_list {
    int data;
    struct linked_list *next;
};
typedef struct linked_list node;

void print(node* n) {
    while (n) {
        cout<< n->data << "->";
        n = n->next;
    }
    cout<< "NULL";
    return;
}

void insert(node** head, int n) {
    node* temp = *head;
    node* list = new node;
    list->data = n;
    list->next = NULL;
    if (temp == NULL) {
        *head = list;
        return;
    }
    while (temp->next)
        temp = temp->next;
    temp->next = list;
    return;
}

void AlternateSplit (node* head, node **aref, node **bref) {
    node* a = NULL, *b = NULL;
    bool s = true;
    while (head) {
        if (s == 1) {
            insert(&a, head->data);
            head = head->next;
            s = !s;
        }
        else {
            insert(&b, head->data);
            head = head->next;
            s = !s;
        }
    }
    *aref = a;
    *bref = b;
    return;
}

int main() {
    int n;
    node* head = NULL, *a = NULL, *b = NULL;
    while (true) {
        cout<< "Enter the number: ";
        cin>>n;
        if (n==-9)
            break;
        else
            insert(&head, n);
    }
    print(head);
    AlternateSplit(head, &a, &b);
    cout<< "\n";
    print(a);
    cout<< "\n";
    print(b);
}