蔡子经数据结构1.14

#include <stdlib.h>

typedef struct 
{
    int val;
    struct * next;
} node;

node* createNode()
{
    node *ret = (node*)malloc(sizeof(node));
    ret->val = 0;
    ret->next = NULL;
    return ret;
}

void del(node *head, int a)
{
    if(head->next->val == a) return;
    node *pre = head;
    node *p = head->next;
    while(p->next)
    {
        if(p->next->val == a)
        {
            pre->next = p->next;
            free(p);
            return ;
        }
        p = p->next;
        pre = pre->next;
    }
    return ;
}

int main()
{
    node *head = createNode();
    node *tail = head;
    for(int i = 0; i < 10; ++i)
    {
        node *p = createNode();
        p->val = i+1;
        tail->next = p;
        tail = tail->next;
    }
    del(head, 2);
    node *p = head->next;
    while(p)
    {
        printf("%d ",p->val);
        p = p->next;
    }
    return 0;
}