程序代码：

Node *Delete(Node *head,int key)
{
    Node *node1=head;
    Node *node2=NULL;
    if (head==NULL)
    {
        return NULL;
    }
    else
    {
        if (node1->number==key)
        {
            head=head->next;
            free(node1);
            return head;
        }
        else
        {
            while (node1!=NULL)
            {
                node2=node1;
                node2=node2->next;
                if (node2->number==key)
                {
                   node1->next=node2->next;
                   free(node2);
                   break;
                }
                node1=node1->next;
            }
            return head;
        }
    }
}

程序代码：

typedef struct node
{
    char str[256];
    struct node* next;
}tnode,*pnode;

tnode* delrjsp(tnode* head, char* key )
{
    tnode anchor;
    anchor.next = head;
    for( pnode p=&anchor; p->next; p=p->next )
    {
        if( strcmp(p->next->str,key)==0 )
        {
            pnode tmp = p->next->next;
            free( p->next );
            p->next = tmp;
        }
    }
    return anchor.next;
}

[此贴子已经被作者于2017-3-14 16:46编辑过]

程序代码：

typedef struct node
{
    char str[256];
    struct node* next;
}tnode,*pnode;


tnode *delw(tnode *head,char* key)
{
    struct node *node1=head;
    struct node *node2=NULL;
    if (head==NULL)
    {
        return NULL;
    }
    else
    {
        if (strcmp(node1->str,key)==0)
        {
            head=head->next;
            free(node1);
            return head;
        }
        else
        {
            while (node1!=NULL)
            {
                node2=node1;
                node2=node2->next;
                if (strcmp(node1->str,key)==0)
                {
                   node1->next=node2->next;
                   free(node2);
                   break;
                }
                node1=node1->next;
            }
            return head;
        }
    }
}