链表删除练习（作代码记录用）

解题思路:

注意事项:

参考代码:

#include<stdio.h>

#include<stdlib.h>

#include<string.h>

typedef struct node

{

    int num;

    struct node *next;

}node;

int main()

{

    int n;

    node *head,*middle,*temp1,*temp2,*temp3;

    scanf("%d",&n);

    head=(node *)malloc(sizeof(node));

    if(head==NULL)

    {

        exit(0);

    }

    head->next=NULL;

    temp1=head;

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

    {

        middle=(node *)malloc(sizeof(node));

        if(middle==NULL)

        {

            exit(0);

        }

        scanf("%d",&middle->num);

        temp1->next=middle;

        temp1=middle;

    }

    temp1->next=NULL;

    int m;

    scanf("%d",&m);

    temp2=head;

    while(temp2->next!=NULL)

    {

        if(temp2->next->num==m)

        {

            node *by=temp2->next;

            temp2->next=by->next;

            free(by);

        }

        else

        {

            temp2=temp2->next;

        }

    }

    temp3=head;

    while(temp3->next!=NULL)

    {

        printf("%d ",temp3->next->num);

        temp3=temp3->next;

    }

    printf("\n");

    return 0;

}