题解 | #牛牛的链表删除#

#include <stdio.h>
#include <stdlib.h>

typedef struct ListNode
{
    int data;
    struct ListNode* next;
}ListNode;

ListNode* Creat_list(int* arr,int n)
{
    ListNode *La = (ListNode*)malloc(sizeof(ListNode));
    La -> data = arr[0];
    La -> next = NULL;
    ListNode* r = La;
    for(int i = 1; i<n; i++)
    {
        ListNode* s = (ListNode*)malloc(sizeof(ListNode));
        s -> data = arr[i];
        s -> next = NULL;
        r -> next = s;
        r = s;
    }
    return La;
}

ListNode* DeleteNode(ListNode* La,int d)
{
    ListNode* head = (ListNode*)malloc(sizeof(ListNode));
    head -> next = La;
    
    ListNode *pa = head,*pb = La;
    while(pb)
    {
         if(pb -> data == d)
         {
            pa -> next = pb -> next;
            free(pb);
            pb = pa -> next;
         }
         else
         {
            pa = pa -> next;
            pb = pb -> next;
         }
    }
    return La;
}

void PrintList(ListNode* La)
{
   ListNode* pa = La;
   while(pa)
   {
    printf("%d ",pa -> data);
    pa = pa -> next;
   }
}

int main() {
    int n = 0,d = 0;
    scanf("%d%d",&n,&d);
    int arr[n];
    for(int i = 0; i<n; i++)
        scanf("%d",&arr[i]);
    ListNode* La = Creat_list(arr,n);
    La =  DeleteNode(La,d);
    PrintList(La);
    return 0;
}

重在链表元素的删除：引入头结点，双移动指针进行删除。