#include<bits/stdc++.h>
using namespace std;
struct node{
    int n;
    struct node *next;
};
//创建链表
struct node* create(int n,int a[105]){
    struct node* head = (struct node*)malloc(sizeof(struct node));
    head->next=NULL;
    struct node* p = head;
    for(int i=0;i<n;i++){
        struct node* now=(struct node*)malloc(sizeof(struct node));
        now->n=a[i];
        now->next=NULL;
        p->next=now;
        p=now;
    }
    return head;
}
//之间将两个链表拼起来再进行冒泡排序
struct node*combine(struct node *head1,struct node*head2,int s1,int s2){
    struct node*p=head1;
    struct node*q=head2;
    while(p->next!=NULL)
        p=p->next;
    p->next=q->next;
    for(int i=0;i<s1...