将两个无序链表合成一个链表

对于链表，可以先将两个链表排序，然后再将其枚举合成一个链表。

或者是先将一个链表接到另一个链表的尾部，然后将总链表排序。

#include <bits/stdc++.h>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <malloc.h>
using namespace std;
struct Node{
    int date;
    struct Node *next;
};
void Sort(struct Node *head,int count){
    struct Node *p;
    p=(struct Node *)malloc(sizeof(struct Node *));
    int temp;
    for(int i=0;i<count-1;i++){
        for(p=head->next;p->next!=NULL;p=p->next){
            if(p->date>p->next->date){
                temp=p->date;
                p->date=p->next->date;
                p->next->date=temp;
            }
        }
    }
}

void bond(struct Node *head1,struct Node *head2){
    struct Node *p;
    p=head1;
    while(p->next!=NULL){
        p=p->next;
    }
    p->next=head2->next;
}

void insert(struct Node *head,int count){
    struct Node *p;
    while(count--){
        p=(struct Node *)malloc(sizeof(struct Node *));
        scanf("%d",&p->date);
        p->next=head->next;
        head->next=p;
    }
}

void out(struct Node *head){
    struct Node *p;
    p=(struct Node *)malloc(sizeof(struct Node *));
    p=head;
    while(p->next!=NULL){
        printf("%d ",p->next->date);
        p=p->next;
    }
    printf("
");
}
int main(){
    struct Node *head1,*head2;
    int n,m;
    head1=(struct Node *)malloc(sizeof(struct Node *));
    head2=(struct Node *)malloc(sizeof(struct Node *));
    scanf("%d%d",&n,&m);
    head1->next=NULL;
    head2->next=NULL;
    insert(head1,n);
    insert(head2,m);
    bond(head1,head2);
    Sort(head1,n+m);
    out(head1);
    return 0;
}