#include <stdio.h> #include<stdlib.h> #define N1 6 /*鏈表La的長度*/  #define N2 6 /*鏈表Lb的長度*/ struct listnode  {  int data;  struct listnode *next; }; void createlist(struct listnode * *,int);  void listinsert(struct listnode * *,struct listnode * *); void readlist(struct listnode *); int main() {    struct listnode *ha=NULL,*hb=NULL;  printf("請按照升序序列輸入以下數字以建立鏈表La/n");  printf("Please Input %d numbers:",N1);  createlist(&ha,N1);  printf("請按照升序序列輸入以下數字以建立鏈表Lb/n");  printf("Please Input %d numbers:",N2);  createlist(&hb,N2);  listinsert(&ha,&hb);  readlist(ha);  printf("/n");  }   void createlist(struct listnode * *p,int n) { /*尾插法建立鏈表*/  struct listnode *t,*q;  int i;  t=(struct listnode *)malloc(sizeof(struct listnode));  scanf("%d",&t->data);  *p=t;  q=t;   for(i=n-1;i>0;i--)     {  t=(struct listnode *)malloc(sizeof(struct listnode));  scanf("%d",&t->data);  q->next=t;  q=t;   }  q->next=NULL; }  void listinsert(struct listnode * *a,struct listnode * *b)  { /*將兩個鏈表按遞增序列排序*/  struct listnode *pa,*pb,*other,*la,*pre;  la=(struct listnode *)malloc(sizeof(struct listnode));  la->next=*a;  pa=*a;     pb=*b;  pre=la;    while(pa&&pb)   {  if(pa->data<pb->data)    {     pre=pre->next;   pa=pa->next;   }  else if (pa->data>pb->data)  {   other=(struct listnode *)malloc(sizeof(struct listnode));   other->data=pb->data;   other->next=pa;   pre->next=other;   pre=other;   pb=pb->next;    }    else  {   pre=pre->next;   pa=pa->next;   pb=pb->next;   }  }    if(!pa)  {  while(pb)  {   other=(struct listnode *)malloc(sizeof(struct listnode));   other->data=pb->data;           pre->next=other;   pre=pre->next;   pb=pb->next;  }  pre->next=NULL;  }  *a=la->next;  free(la); }  void readlist(struct listnode *p) { /*遍歷鏈表并輸出最終結果*/  struct listnode *q;  q=p;  printf("鏈表的排序結果為:/n");  while(q!=NULL)    {  printf("%3d",q->data);  q=q->next;  }  printf("/n"); }