链表源代码(C语言实现)

源代码(C语言实现)

      ①.构造链表节点

             typedef struct Node    //一个单独的节点
                   {
                         int data;//数据域
                         struct Node * pNext;//指针域
                    }NODE,* PNODE;

         ②.链表的初始化

           PNODE init_list()
                  {
                          int len ;//链表的长度
                          int i;//循环开关
                          int val;//节点的值

                          PNODE pHead = (PNODE)malloc(sizeof(NODE));//造出头结点

                          if (NULL==pHead)
                          {
                               printf("链表动态分配失败!程序终止!\n");
                               exit(-1);
                          }
                          else
                          {
                                printf("请输入要创建链表的长度len=");
                                scanf("%d",&len);

                                if (0==len)
                                {   
                                     pHead->pNext = NULL;
                                      return pHead;  //对空链表的处理
                                 }
                                 if (len<0)  //对长度为负数的处理
                                  {
                                         printf("链表的长度不能为负数!\n");
                                         exit(-1);
                                  }

                                 PNODE pTail = pHead;//pTail指向的是尾节点
                                 pTail->pNext = NULL;

                                 for (i=0;i<len;i++)
                                  {
                                       PNODE pNew = (PNODE)malloc(sizeof(NODE));//造出新的节点
                                       printf("请输入第%d个节点的数值val =",i+1);
                                       scanf("%d",&val);

                                       pNew->data = val;  //赋值
                                       pTail->pNext = pNew; //连接新的节点
                                       pTail = pNew;      //pTail后移
                                   }
                                   pTail->pNext = NULL;//最后一个节点的指针域必须为空
                                   return pHead; //返回头结点以用来表示整个链表


                                     }
                  }

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值