struct node *delete_from_list(struct node *list, int n)
{
 struct node *cur, *prev;

for (cur = list, prev = NULL;
      cur != NULL && cur->value != n;
      prev = cur, cur = cur->next)
    ;
 if (cur == NULL)
   return list;
 if (prev ==NULL)
   list = list->next;
else
   prev->next = cur->next;
  free(cur);
  return list;
}修改使用一个指针变量而不是两个（即cur和prev)

修改后如下：
struct node *delete_from_list(struct node **list, int n)   //**list为指向需要修改的list指针的指针
{
 struct node *cur;

while ((cur = (*list) != NULL && cur->value < new_node->value)
         *list = cur->list;
   
 if (cur == NULL)
   return *list;
 else
    *list = cur->list;
  free(cur);
  return *list;
}

修改为此，正确吗？

自己实现一个链表实现一下不就知道了！

目测修改为二级指针画蛇添足了

如果不用2级指针，目测无法使用只1个指针.毕竟需要一个指针来删除节点，而它前面那个指针得指向被删除节点的下一个。

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

typedef unsigned int uint;

typedef struct LinkNodeTag
{
    uint elem;
    struct LinkNodeTag *next;
} LinkNode, *LinkList;

LinkList CreateLink(uint *data, size_t length)
{
    LinkList s, tail, head = NULL;

    tail = head = calloc(1, sizeof(LinkNode));
    for (size_t i = 0;i < length;i++)
    {
        s = calloc(1, sizeof(LinkNode));
        s->elem = data[i], s->next = NULL;

        tail->next = s;
        tail = s;
    }
    return head;
}

void PrintLink(LinkList linkList)
{
    LinkList p = linkList->next;

    printf("LinkList : ");
    while (p)
    {
        printf("%u ", p->elem);
        p = p->next;
    }
    printf("NULL\n");
}

void DestroyLink(LinkList linkList)
{
    if (linkList->next) DestroyLink(linkList->next);
    free(linkList);
}

void DeleteFromLink(LinkList linkList, uint number)
{
    LinkList p;

    while (linkList->next)
    {
        if (linkList->next->elem == number)
        {
            p = linkList->next;
            linkList->next = linkList->next->next;
            free(p);
            return;
        }
        linkList = linkList->next;
    }
    return;
}

int main(void)
{
    uint data[] = { 1, 3, 5, 7 };
    LinkList linkList = CreateLink(data, sizeof(data) / sizeof(uint));

    PrintLink(linkList);
    DeleteFromLink(linkList, 7);
    PrintLink(linkList);

    DestroyLink(linkList);
    return 0;
}

这个是带头节点的

我好好看看