单链表的创建\头插法\尾插法\删除结点\插入结点CPP实现

单链表的CPP实现

主要实现了头插法、尾插法、查找、遍历、删除、插入功能。
主函数为测试用例

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <vector>
using namespace std;

//链表结点
typedef struct LinkNode {
     int elem;
     struct LinkNode* next;
}LN,*LP;

//头插法创建新链表
void headIn(LP head,vector<int> ElemArry) {
     //LP p = (LP)malloc(sizeof(LN));
     int NumOfElem = ElemArry.size();
     int i = 0;
     while (i < NumOfElem) {
          LP p = (LP)malloc(sizeof(LN));
          p->elem = ElemArry[i];
          p->next = head->next;
          head->next = p;
          ++i;
     }
}

//尾插法创建新链表
void  tailIn(LP head, vector<int> ElemArry) {
     int NumOfElem = ElemArry.size();
     int i = 0;
     LP r = head;//哨兵
     while (i < NumOfElem) {
          LP p = (LP)malloc(sizeof(LN));
          p->elem = ElemArry[i];
          p->next = NULL;
          r->next = p;
          r = p;
          ++i;
     }
}


//特定位置插入结点
//需要知道此节点的前驱结点
//以下示例为给出具体位置，如果给出具体数据，可以利用查找结点的函数，增加返回值改为所找到数据的结点位置即可

int inserNode(LP head,int plac,int value) {//首元节点位置为0，头结点不参与计数
     LP NewNode = (LP)malloc(sizeof(LN));
     NewNode->elem = value;
     if (plac==0){//在首部插入数据
          NewNode->next = head->next;
          head->next = NewNode;
          return 0;
     }
     LP pre = head;
     for (int i = 0; i < plac; i++) {
          pre = pre->next;
     }//寻找位置plac的前驱节点
     NewNode->next = pre->next;
     pre->next = NewNode;
     return 0;
}

//固定位置删除节点
//需要知道删除位置的前驱结点
int delNode(LP head, int plac) {
     if (plac == 0) {//删除首元结点
          head->next = head->next->next;
          return 0;
     }
     LP pre = head;
     for (int i = 0; i < plac; i++) {
          pre = pre->next;
     }//寻找位置plac的前驱节点
     LP de = pre->next;
     pre->next = pre->next->next;
     free(de);
     return 0;
}





//查找结点
int searchList(LP head,int num) {
     if (head->next == NULL) {
          printf("链表为空");
          return 0;
     }
     //LP p = (LP)malloc(sizeof(LN));
     LP p = head;
     int tag = 0;
     while (p->next != NULL) {
          if (p->next->elem == num) {
               printf("%d", tag);
               return 0;//找到
          }
          p = p->next;
          ++tag;
     }
     printf("未找到\n");
    return 0;
}

//打印链表
void playList(LP head) {
     LP p = head;
     while (p->next!=NULL) {
          printf("%d-->", p->next->elem);
          p = p->next;
     }
     printf("\n");
}

int main() {
     vector<int> ElemArry = { 1,2,3,4,5,6,7 };
     int SearchNum;
     LP head=(LP)malloc(sizeof(LN));
     head->next = NULL;
     //headIn(head, ElemArry);
     tailIn(head, ElemArry);
     //playList(head);
     //printf("输入要查找的数据:    ");
     //scanf("%d", &SearchNum);
     //searchList(head, SearchNum);
     delNode(head,0);
     playList(head);
     inserNode(head,0,1);
     playList(head);
     delNode(head,5);
     playList(head);
     inserNode(head, 5, 5);
     playList(head);
     return 0;
}