线性表相关操作，不全但会慢慢增加

#include<iostream>
using namespace std;

typedef struct Node{
    int data;
    struct Node *next;
}Node;

//头插法建立链表
Node *createListFromHead(int a[], int n){
    Node *A = new Node();
    A->next = NULL;
    for(int i=0; i<n; i++){
        Node *p = new Node();
        p->data = a[i];
        p->next = A->next;
        A->next = p;
    }
    return A;
} 

//尾插法建立链表
Node *createListFromEnd(int a[], int n){
    Node *A = new Node();
    A->next = NULL;
    Node *p = A;
    for(int i=0; i<n; i++){
        Node * q = new Node();
        q->next = NULL;
        q->data = a[i];
        p->next = q;
        p = q;
    } 
    return A;
} 

void show(Node *List){
    Node *p = List->next;
    while(p){
        cout<<p->data<<endl;
        p = p->next;
    }
}

void uni(Node *A, Node *B){
    Node *Apre = A, *Anow = A->next;
    Node *Bnow = B->next;
    while(Anow && Bnow){
        while(Bnow && Bnow->data < Anow->data){
            Bnow = Bnow->next;
        }
        if(Bnow && Bnow->data != Anow->data){
            Apre->next = Anow->next;
            
        }else{
            if(!Bnow){
                break;
            }
            Apre = Apre->next;
        }
        Anow = Anow->next;
        
    }
    
        Apre->next = NULL;
//    cout<<Apre->data<<endl<<endl;
}

void Merge(Node *A, Node *B){
    Node *Apre = A, *Anow = A->next;
    Node *Bnow = B->next;
    while(Anow && Bnow){
        while(Anow && Anow->data < Bnow->data){
            Anow = Anow->next;
            Apre = Apre->next;
        }
        Node *Bc = Bnow;
        Bnow = Bnow->next;
        Bc->next = Apre->next;
        Apre->next = Bc;
        Apre = Apre->next;
    }
    Apre->next = Bnow;
}

int main(){
    int a[]={1,2,4,6,8,9,11,13,17};
    int b[]={0,3,5,6,10};
//    Node *A = createListFromHead(a, 9);
    Node *A = createListFromEnd(a, 9);
    Node *B = createListFromEnd(b,5);
//    uni(A, B);
    Merge(A, B);
    show(A);
//    cout<<endl;
//    show(B);
}