1.思路:
这里的顺序链表与STl的list容器原理相似。这里运用到了结构体实现增删改查等管理功能。
list基本概念
功能:将数据进行链式存储
链表的组成:链表由一系列结点组成,结点由存储数据元素的数据域和存储下一个结点地址的指针域组成。
注意事项:
代码中,head.next开始才为第一个数据元素,后面按数组原理去理解即可。
代码实现:
头文件.h
#pragma once
#include <iostream>
using namespace std;
typedef struct SNode {
void* data;
struct SNode* next;
}Snode;
typedef struct MYlist {
Snode *head;
int size;
}Mylist;
//注意:这里的下标为第几个结点!
typedef void(*PrintList)(void*);
Mylist* init_Mylist();//创建初始化
void Print_Mylist(Mylist *list, PrintList print);//打印
void insert_Mylist(Mylist* list,int pos,void *value);//按下标插入值
void delete_Mylist(Mylist* list,void *value);//按值删除
Snode* findvalue_Mylist(Mylist* list, int pos);//按下标查找值
int findpos_Mylist(Mylist* list, void *value);//按值查找下标(第几个结点)
Snode* first_Mylist(Mylist *list);//返回第一个结点的值
void free_Mylist(Mylist *list);//摧毁内存
xxx.cpp文件
#include "Mylist.h"
Mylist* init_Mylist()
{
Mylist* list = (Mylist*)malloc(sizeof(Mylist));//为结构体分配内存空间
list->head= (Snode*)malloc(sizeof(Snode));//为结点分配内存空间
list->size = 0;
list->head->next = NULL;
list->head->data = NULL;
return list;
}
void Print_Mylist(Mylist* list, PrintList print)
{
if (list == NULL) {
cout<<"数据未存在!" << endl;
}
Snode* Node = list->head->next;
while (Node!=NULL) {
print(Node->data);//输出结点数据
Node = Node->next;
}
}
void insert_Mylist(Mylist* list,int pos,void *value)
{
if (list == NULL) {
cout << "数据未存在!" << endl;
}
if (pos<0 || pos>=list->size) {
pos= list->size;
}
Snode* NewNode = (Snode*)malloc(sizeof(Snode));//创建要插入的结点
NewNode->data = value;
NewNode->next = NULL;
Snode* Pcur = list->head;//插入结点的前一个
//查找过程
for (int i = 0;i<pos;i++) {
Pcur = Pcur->next;
}
//与链表建立关系
NewNode->next=Pcur->next;
Pcur->next=NewNode;
list->size++;
}
void delete_Mylist(Mylist* list, void *value)
{
int pos = 0,count=0;
if (list == NULL) {
cout <<"数据为空!" << endl;
}
//找出要删除结点的下标
pos=findpos_Mylist(list, value);
if (pos < 0 || pos >= list->size) {
cout<<"没有你要删除的数据!" << endl;
}
SNode* pPre = list->head;
for (int i = 0; i < pos ; i++) {
pPre = pPre->next;
}
//使用临时变量删除pos节点
SNode* pCur = pPre->next;
//删除
pPre->next = pCur->next;
free(pCur);
pCur->next = NULL;
list->size--;
}
//按结点为查找值
Snode* findvalue_Mylist(Mylist* list, int pos)
{
Snode* node = list->head->next;
for (int i = 0;i<pos;i++) {
node = node->next;
}
return node;
}
//按值查找结点位置
int findpos_Mylist(Mylist* list,void *value)
{
if (list == NULL) cout<<"链表数据为空!" << endl;
int pos =0;
//找出要删除的第几个结点
Snode* delenode = list->head->next;
while (delenode!= NULL) {
if (delenode->data == value) {
break;
}
delenode = delenode->next;
pos++;
}
if (pos == list->size) {
cout<<"没有找到!" << endl;
}
return pos;
}
Snode* first_Mylist(Mylist* list)
{
return list->head->next;
}
void free_Mylist(Mylist* list)
{
if (list == NULL) {
cout<<"链表数据为空,不存在!" << endl;
}
free(list);
}
主函数测试文件
#include "Mylist.h"
struct Student {
char name[20];
int age;
int score;
}stu[5];
//自定义类型输出
void print(void *data) {
struct Student* s =(struct Student*) data;
cout<<"姓名:"<<s->name<<" 年龄:"<<s->age<<" 分数:" <<s->score<<endl;
}
int main() {
Mylist* list = init_Mylist();
stu[0] = {"gg",18,59};
stu[1] = {"hp",19,61};
stu[2] = {"yy",20,70};
stu[3] = { "gy",19,81 };
stu[4] = { "ty",20,90 };
insert_Mylist(list,0,&stu[4]);
insert_Mylist(list,0,&stu[3]);
insert_Mylist(list, 0, &stu[2]);
insert_Mylist(list, 0,&stu[1]);
insert_Mylist(list,0, &stu[0]);
Print_Mylist(list,print);
cout << "-------------- " << endl;
print(&stu[3]);
cout<<"的结点位置为:"<<findpos_Mylist(list,&stu[3]) << endl;
cout<<"删除这个结点:" << endl;
delete_Mylist(list,&stu[3]);
Print_Mylist(list, print);
cout << "============" << endl;
cout<<"在第三个位置插入之前删除的结点" << endl;
insert_Mylist(list,3,&stu[3]);
Print_Mylist(list, print);
cout<<"按下标2查找值:" << endl;
Snode *node=findvalue_Mylist(list,2);
print(node->data);
cout<<"第一个结点的值为:" << endl;
print(first_Mylist(list)->data);
return 0;
}