下面这个只能删除一个节点，如果想把链表中所有等于m的节点删除应该怎么改？

struct ListNode *deletem( struct ListNode *L, int m )
{
    struct ListNode *p;
    struct ListNode *pre;
    pre=L;
    p=pre->next;
    if(pre->data==m)
    {
        L=p;
        free(pre);
    }
    while(p!=NULL)
    {
        if(p->data==m)
        {
            pre->next=p->next;
            free(p);
            p->next=NULL;
        }
        pre=pre->next;
        p=p->next;
    }
    return L;
} 

deletem()函数存在一些问题，例如如果头结点为m,那么把它free了后，while循环里面怎么还能够 pre=pre->next;？另外，free(p);后，p即为空指针，又怎么能p->next=NULL？
删除所有值为m的结点也不难：
struct ListNode *deletem( struct ListNode *L, int m )
{
    struct ListNode *ptr, temp;
   
    ptr = L;
    while(ptr)
    if(ptr->data == m && ptr == L){ //头结点值为m
        temp = ptr;
        L = ptr = ptr->next;
        free(temp);
    }else if(ptr->data == m){
        temp = ptr;
        ptr = ptr->next;
        free(temp);
    }else
        ptr = ptr->next;

    return L;
}

代码没经过测试，有问题反馈

[此贴子已经被作者于2017-4-17 11:36编辑过]

看来留以前写的代码还是有好处的，随手找找就有了。

#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#define T ListNode
typedef struct T *T;
void
Insert( T *RootPP, int value );
void
Delete( T *RootPP, int value );
void
PrintList( T RootP );

struct T{
    int data;
    T next;
};

int
main( void )
{
    T Root;
    int value;

    Root = NULL;

    while( 1 == scanf( "%d", &value ) && -1 != value )
            Insert( &Root, value );
    getchar();

    scanf( "%d", &value );
    Delete( &Root, value );

    PrintList( Root );


    return 0;
}

void
Insert( T *RootPP, int value )
{
    T This;
    T NewCell;

    while( NULL != ( This = *RootPP ) )
        RootPP = &This->next;

    NewCell = ( T )malloc( sizeof( struct T ) );
    assert( NULL != NewCell );
    NewCell->data = value;
    NewCell->next = This;
    *RootPP = NewCell;
}

void
Delete( T *RootPP, int value )//删除链表中值等于value的所有节点
{
    T This;

    while( NULL != ( This = *RootPP ) )
    {
        if( This->data == value )
        {
            *RootPP = This->next;
            free( This );
            continue;
        }
        RootPP = &This->next;
    }
}

void
PrintList( T RootP )
{
    while( NULL != Root )
    {
        printf("%d ",RootP->data );
        RootP = RootP->next;
    }
}

[此贴子已经被作者于2017-4-19 20:50编辑过]