线性表----单链表删除指定节点

#include <stdio.h>

struct Test
{
        int data;
        struct Test *next;
};

void printLink(struct Test *head)
{
        struct Test *p;
        p = head;

        while(p != NULL){

                printf("data = %d\n",p->data);
                p = p->next;
        }

        printf("------------------\n");
}

struct Test *insertFromfor(struct Test *head,struct Test *new,int data2)
{

        if(head->data == data2){

                new->next = head;
                head = new;
                return head;
        }

        while(head->next != NULL){

                if(head->next->data == data2){
 
                        new->next = head->next;
                        head->next = new;

                        return head;
                }
                head = head->next;

        }

        printf("do find data\n");
        return head;
}

struct Test *deleteNode(struct Test *head,int data2)
{
        if(head->data == data2){

                head = head->next;
                return head;
        }

        while(head->next != NULL){

                if(head->next->data == data2){

                        head->next = head->next->next;
                        return head;
                }
                head = head->next;
        }
        printf("do find data\n");
}

int main()
  {
        struct Test t1 = {1,NULL};
        struct Test t2 = {2,NULL};
        struct Test t3 = {3,NULL};
        struct Test t4 = {4,NULL};

        struct Test t = {100,NULL};

        t1.next = &t2;
        t2.next = &t3;
        t3.next = &t4;

        struct Test *head = &t1;

        printLink(head);

        head = deleteNode(head,5);
        printLink(head);

        return 0;
}
                                                                                                             
                                                                                                                    

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值