表篇（二）-----单链表的创建与使用（c语言版）

本篇讲解单链表的创建，我的实例代码虽然没有多少行，但是每一行都测试过，一篇代码写下来需要两个小时！真的很慢，看代码的时候可以结合注释，实在有不懂的地方底部留言

#include<stdio.h>#include<iostream>#include<stdlib.h>typedef struct Node{     //利用结构体，创建单链表的储存结构int data;            //节点的数据域struct Node *next;   //节点的指针域}NODE,*LinkList;         //LinkList为指向结构体NODE的指针类型LinkList CreateList(void){   //创建单链表，并初始化单链表长度和数据域int i, data, length;LinkList p_new = NULL, pTail = NULL;LinkList pHead = (LinkList)malloc(sizeof(NODE));   //创建单链表的头指针pHead->data = 0;pHead->next = NULL;pTail = pHead;printf("请输入要创建链表的长度：\n");scanf_s("%d", &length);for (i = 1; i <= length; i++){p_new = (LinkList)malloc(sizeof(NODE));      //创建一个临时的保存每次输入数据的数据域printf("请输入第%d个节点值\n", i);scanf_s("%d", &data);p_new->data = data;                        //先将输入的数据，赋给临时数据域p_new->next = NULL;                      //临时数据域的指针域为空，即临时数据域为链表的最后一个pTail->next = p_new;                    //将头指针指向临时数据域pTail = p_new;                         }return pHead;}void TraverseList(LinkList pHead){LinkList pt = pHead->next;printf("打印链表");while (pt != NULL){printf("%d,", pt->data);pt = pt->next;}}int getLengthList(LinkList pHead){int length = 0;LinkList pt = pHead;while (pt != NULL){length++;pt = pt->next;}return length;}bool InsertLink(LinkList pHead, int i, int e){LinkList pt = NULL, p_new = NULL;if (i<1 || i>getLengthList(pHead) + 1){return false;}p_new = (LinkList)malloc(sizeof(NODE));while (1){i--;if (i == 0){break;}pHead = pHead->next;}pt = pHead;p_new->data = e;p_new->next = pt->next;pt->next = p_new;return true;}bool DelectLink(LinkList pHead,int i,int &e){LinkList pt=NULL,delpt=NULL;if (i<1 || i>getLengthList(pHead)){return false;}delpt = (LinkList)malloc(sizeof(NODE));while (1){i--;if (i == 0){break;}pHead = pHead->next;}pt = pHead;delpt = pt->next;pt->next = delpt->next;e = delpt->data;delete delpt;return true;}int main(){int l,e;LinkList head = CreateList();TraverseList(head);l = getLengthList(head)-1;printf("\n此时链表长度为：%d", l);InsertLink(head, 3, 11);printf("\n");TraverseList(head);l = getLengthList(head)-1;printf("\n此时链表长度为：%d", l);DelectLink(head, 1, e);printf("\n删除位置为1,元素为%d", e);l = getLengthList(head) - 1;printf("\n此时链表长度为：%d", l);system("pause");return 0;}