[编程入门]链表之节点删除-题解（C语言代码）

参考代码:

#include <stdio.h>

#include <malloc.h>

typedef struct student{

    int number;

    int grade;

    struct student* next;

}*intNode,Node;

intNode createList(int num);

intNode deleteList(intNode h1,intNode h2,int m,int n);

void printList(intNode h);

int main(){

    int m,n;

    scanf("%d %d",&m,&n);

    intNode h1,h2,h;

    h1=createList(m);

    h2=createList(n);

    h=deleteList(h1,h2,m,n);

    printList(h);

    return 0;

}

intNode createList(int num){

    intNode h,tail,p;

    h=tail=p=NULL;

    for(int i=0;i<num;i++){

        p=(intNode)malloc(sizeof(Node));

        scanf("%d %d",&p->number,&p->grade); 

        if(h==NULL) h=tail=p;

        else tail=tail->next=p;

    }

    if(tail) tail->next=NULL;

    return h;

}

void printList(intNode h){

    intNode p,q;

    int n=0;

    q=p=h;

    while(p){

        n++;

        p=p->next;

    }

    printf("%d\n",n);

    while(q){

        printf("%d %d\n",q->number,q->grade);

        q=q->next;

    }

    return;

}

intNode deleteList(intNode h1,intNode h2,int m,int n){

    intNode w,p,q;

    q=h2;

    for(int i=0;i<n;i++){

        w=p=h1;

        while(p){

            if(p->number==q->number){

                if(p==h1) h1=p->next;

                else w->next=p->next;

            }else w=p;

        p=p->next;

        }

    q=q->next;

    }

    return h1;

}