SCAU：1099 [填空题]链表的合并

本文介绍: 时间限制:1000MS 代码长度限制:10KB提交次数:2549 通过次数:1736题型: 填空题语言: GCC。

1099 [填空题]链表的合并

时间限制:1000MS 代码长度限制:10KB
提交次数:2549 通过次数:1736

De script ion

下面程序创建两个链表，然后将第二个链表合并到第一个链表未尾，但合并部分的代码未完成，请你完成这部分代码。

#include “std io.h“
#include “malloc.h“
#define LEN sizeof(struct student)

struct student
{
     long num;
     int score;
     struct student *next;
};

struct student *create(int n)
{
     struct student *head=NULL,*p1=NULL,*p2=NULL;
     in t i;
     f o r(i=1;i<=n;i++)
     {  p1=(struct student *)malloc(LEN);
        scan f(“%ld“,&p1->num);
        scan f(“%d“,&p1->score);
        p1->next=NULL;
        i f(i==1) head=p1;
        else p2->next=p1;
        p2=p1;
      }
      return(head);
}

s truct student *merge(s truct student *head, s truct student *head2)
{
_______________________
}

void print(s truct student *head)
{
    s truct stu de nt *p;
    p=he ad;
    while(p!=NULL)
    {
        printf(“%8ld%8d“,p->num,p->score);
        p=p->n ext;
        printf(“n“);
    }
}

main()
{
    s truct stu de nt *he ad, *he ad2;
    int n;
    long d el_num;
    scanf(“%d”,&n);
    he ad=create(n);
    print(he ad);
    sc a nf(“%d”,&n);
    he ad2=create(n);
    print(he ad2);
    he ad = merge(he ad, he ad2);
    print(h e ad);
}

输入 样例

2			（the 1st linked list, 2 students）
1			（code of no.1 studentof the 1st linked list）
98			（score of no.1 student of the 1st linked list）
7			（code of no.2 student of the 1st linked list）
99			（score of no.2 student of the 1st linked list）
1			（the 2nd linked list, 1 student）
5			（code of no.1 student of the 2nd linked list）
87			（score of no.1 student of the 2nd linked list）

输出 样例

#include "stdio.h"
#include "malloc.h"
#define LEN sizeof(struct student)

struct student
{
     long num;
     int score;
     struct student *next;
};

struct student *create(int n)
{
     struct student *head=NULL,*p1=NULL,*p2=NULL;
     int i;
     for(i=1;i<=n;i++)
     {  p1=(struct student *)malloc(LEN);
        scanf("%ld",&amp;p1-&gt;num);
        scanf("%d",&amp;p1-&gt;score);
        p1-&gt;next=NULL;
        if(i==1) head=p1;
        else p2->next=p1;
        p2=p1;
      }
      return(head);
}

struct student *merge(struct student *head, struct student *head2)
{
    struct student *s,*p;
    s=head2;
    p=head;
    while(p->next!=NULL)//这里是循环结构，不要混淆if和while，功能完全不一样，一个是条件一个是循环
    {
        p=p->next;
    }
    p->next=s;
    return(head);
}


void print(struct student *head)
{
    struct student *p;
    p=head;
    while(p!=NULL)
    {
        printf("%8ld%8d",p->num,p->score);
        p=p->next;
        printf("n");
    }
}

main()
{
    struct student *head, *head2;
    int n;
    long del_num;
    scanf("%d",&amp;n);
    head=create(n);
    print(head);
    scanf("%d",&amp;n);
    head2=create(n);
    print(head2);
    head = merge(head, head2);
    print(head);
}