删除双向链表中的节点（数据结构）答案

【问题标题】：delete node in doubly linked list (Data Structures)删除双向链表中的节点（数据结构）
【发布时间】：2016-07-30 14:30:20
【问题描述】：

在双向链表的删除节点函数中，谁能解释一下 (pointer->next)->data != data in while 循环如何工作？

   void delete(node *pointer, int data) {
       while (pointer->next!=NULL && (pointer->next)->data != data) {
           pointer = pointer -> next;
       }

       if (pointer->next == NULL) {
           printf("Element %d is not present in the list\n", data);
           return;
       }

       node *temp;
       temp = pointer->next;

       pointer->next = temp->next;
       temp->prev =  pointer;

       free(temp);

       return;
}

【问题讨论】：

什么是pointer->next？它是列表中的下一个节点吗？然后再想一想……那么pointer->next->data 会是什么？将pointer->next->data 与this->data 进行比较的原因可能是什么（我假设）？
这是下一个节点中的数据得到了它@JoachimPileborg
另外，你确定你是在C++而不是C?没有特定于 C++ 的代码，而是使用 delete 作为 C++ 中不允许的函数名称，因为 delete 是 C++ 中的 关键字。请适当标记您的问题。
我已经写了代码@mik1904
阅读一本关于 C++ 的书。与 *.com 上的 500 个字符的评论相比，它将对指针的工作原理进行更详细和更详细的解释

标签： c

【解决方案1】：

您可以使用此代码插入删除和更新。

#include<stdio.h>
struct double_linklist{
    int val;
    struct double_linklist *back;
    struct double_linklist *next;
}*start=NULL;
typedef struct double_linklist dl;

void main()
{
    dl *current,*New,*min;
    int n,ch,i;
    do{
        New = (dl *)malloc(sizeof(dl));
        system("cls");
        printf("enter element");
        New->val=getch()-'0';
        printf("%d",New->val);
        New->back = NULL;
        New->next = NULL;
        if(start == NULL)
        {
            start = New;
            current = New;
        }

        else{
            current->next = New;
            New->back = current;
            current = New;
        }
        printf("\n\nIfyou want to input next element then press y");

    }while(getch()=='y');

    system("cls");
    printf("the elements are : \n");
    current = start;
    while(current->next != NULL)
        {
            printf("%d-->",current->val);
            current = current->next;
        }
        printf("%d",current->val);


        printf("\n\n1. Insert\n2. Delete\n3. Search\n4. Sort\n");
        ch=getch()-'0';
        switch(ch){
            case 1 : printf("enter the position");
                        n=getch()-'0';
                     printf("enter the val");
                     New = (dl *)malloc(sizeof(dl));
                     New->val =getch()-'0';
                     New->back = NULL;
                     New->next = NULL;
                     current = start;
                     for(i=0;i<n-1;i++)
                     {
                        current =current->next;
                     }
                     current->back->next= New;
                     New->back = current->back;
                     New->next= current;
                     current->back=New;

                     printf("after inserting the link list are : ");
                     current =start;
                        while(current->next != NULL)
                    {
                        printf("%d-->",current->val);
                        current = current->next;
                    }
                    printf("%d",current->val);
                    break;

            case 2: printf("enter a value do you want to delete : ");
                    n=getch()-'0';
                    printf("%d",n);
                    current = start;
                    while(current->val!=n)
                        current = current->next;
                    current->back->next = current->next;
                    current->next->back = current->back;
                    current->back = NULL;
                    current->next = NULL;
                     printf("after deleting the link list are : ");
                     current =start;
                        while(current->next != NULL)
                    {
                        printf("%d-->",current->val);
                        current = current->next;
                    }
                    printf("%d",current->val);
                    break;

            case 3: printf("enter a number do you want to search");
                    n=getch()-'0';
                    printf("%d",n);
                    current = start;
                    i=1;
                    while(current->next != NULL)
                    {
                        if(current->val == n)
                            printf("%d\t",i);
                        current = current->next;
                        i++;

                    }
                    if(current->val == n)
                            printf("%d\t",i);
                    break;

            case 4: New=start;
                    current = start;
                    min = current;
                    while(New->next != NULL)
                    {

                        while(current->next != NULL)
                        {
                            current = current->next;
                            if(current->val < min->val)
                                min = current;
                        }
                        ch = min->val;
                        min->val = New->val;
                        New->val = ch;

                        New = New->next;
                        current = New;
                        min = current;
                    }
                    printf("\nAfter sorting:\n");
                     current = start;
                        while(current->next != NULL)
                    {
                        printf("%d-->",current->val);
                        current = current->next;
                    }
                    printf("%d",current->val);
                    break;
            }
}

【讨论】：