两个链表的合并

最新推荐文章于 2024-06-13 09:28:56 发布

原创最新推荐文章于 2024-06-13 09:28:56 发布 · 688 阅读

0 ·

CC 4.0 BY-SA版权

Java 专栏收录该内容

41 篇文章

订阅专栏

本文详细介绍了链表的创建、插入、遍历过程，并实现了排序算法，展示了链表在数据结构中的应用。

#include <stdio.h>
#include <malloc.h>
#define LEN sizeof(struct student)
struct  student
{long num;
 int score;
 struct student *next;
};

struct student lista,listb;
int n,sum=0;

int main()
{struct student *creat(void);
 struct student *insert(struct student  *,struct student *);
 void print(struct student *);
 struct student *ahead,*bhead,*abh;
 printf("input list a:\n");
 ahead=creat();
 sum=sum+n;
 printf("input list b:\n");
 bhead=creat();
 sum=sum+n;
 abh=insert(ahead,bhead);
 print(abh);
 return 0;
}

struct student *creat(void)       //建立链表函数
 {struct student *p1,*p2,*head;
  n=0;
  p1=p2=(struct student *)malloc(LEN);
  printf("input number & scores of student:\n");
  printf("if number is 0,stop inputing.\n");
  scanf("%ld,%d",&p1->num,&p1->score);
  head=NULL;
  while(p1->num !=0)
    {n=n+1;
     if (n==1)
       head=p1;
     else
       p2->next=p1;
     p2=p1;
     p1=(struct student *)malloc(LEN);
     scanf("%ld,%d",&p1->num,&p1->score);
    }
    p2->next=NULL;
  return(head);
}

/*struct student *creat(void)
 {
 	struct student*p1,*p2,*head;
 	n=0;
 	p1=p2=(struct student*)malloc(LEN);
 	scanf("%ld,%d",&p1->num,&p1->score);
 	while(p1->num!=0)

 	 {
	 	n=n+1;
	 	if(n==1)
	 	head=p1;
	 	else
	 	p2->next=p1;
	 	p2=p1;
 	    p1=(struct student*)malloc (LEN);
        scanf("%ld %d",&p1->num,&p1->score);
 	 }
	 p2->next=NULL;	
	 	
	 return (head);
 }
 */   
/*struct student *insert(struct student *ah,struct student *bh)   //插入函数
 {struct student * pa1,* pa2,* pb1,* pb2;
  pa2=pa1=ah;
  pb2=pb1=bh;
  do
  {while((pb1->num>pa1->num) && (pa1->next !=NULL))
           {pa2=pa1;
             pa1=pa1->next;
           }
         if (pb1->num <= pa1->num)
            {if (ah==pa1)
	             ah=pb1;
         else 
		     pa2->next=pb1;
	         pb1=pb1->next;
             pb2->next=pa1;
             pa2=pb2;
	         pb2=pb1;
	        }
	}while ((pa1->next!=NULL) || (pa1==NULL && pb1!=NULL));
    if ((pb1!=NULL) && (pb1->num>pa1->num) && (pa1->next==NULL))
      pa1->next=pb1;
    return(ah);
 }
*/
/*struct student *creat(void)
 {
 	struct student*p1,*p2,*head;
 	int n=0;
 	p1=p2=(struct student*)malloc(LEN);
 	scanf("%d,%f",&p1->num,&p1->score);
 	while(p1->num!=0)

 	 {
	 	n=n+1;
	 	if(n==1)
	 	head=p1;
	 	else
	 	p2->next=p1;
	 	p2=p1;
 	    p1=(struct student*)malloc (LEN);
        scanf("%d %f",&p1->num,&p1->score);//给成员赋值时注意要带赋值号 
 	 }
	 p2->next=NULL;	
     return (head);
 }
 
 */
 struct student *insert(struct student *ah,struct student *bh) 
 {
 	struct student *pa1,*pa2,*pb1,*pb2;
 	pa2=pa1=ah;
    pb2=pb1=bh; 
 	do
 	{
	 	while((pb1->num>pa1->num)&&(pa1->next!=NULL))
	 	{
	 		pa2=pa1;
	 		pa1=pa1->next; 
	 	}
	 	if(pb1->num<=pa1->num)
	 	   {//if(pa1=ah)
	        if(ah==pa1)//等号啊，你是让我怎么办才能不把==写成= 
	 	    	ah=pb1;
 	        else
 	        	pa2->next=pb1;
 	        	pb1=pb1->next;
 	        	pb2->next=pa1;
       		    pa2=pb2;//这个条件也容易忘记 
 	        	pb2=pb1;
	 	   }

	 }while((pa1->next!=NULL)||(pa1==NULL&&pb1!=NULL));//逗号不能忘了 ,还有==和=区分开 
	 if ((pb1!=NULL) && (pb1->num>pa1->num) && (pa1->next==NULL))
	 pa1->next=pb1;
	 return(ah);
 }
 
void print(struct student *head)  //输出函数
  {struct student  *p;
   printf("There are %d records:  \n",sum);
   p=head;
   if (p !=NULL)
     do
       {printf("%ld %d\n",p->num,p->score);
	    p=p->next;
       }while (p !=NULL);
   }

/*
1001 ,60 
1090 ,68
1050 ,58
0
1058 ,96
1040 ,52
0
*/