#ifndef SRC_LINKLIST_H_
#define SRC_LINKLIST_H_
#include<stdlib.h>
#include<stdio.h>
typedef struct LINKNODE {
void *data;
struct LINKNODE *next;
} LinkNode;
typedef struct LINKLIST {
LinkNode *head;
int size;
}LinkList;
typedef void(*PRINTLINKNODE)(void *);
LinkList * Init_LinkList();
void Insert_LinkList(LinkList *list, int pos, void *data);
void RemoveByPos_LinkList(LinkList *list, int pos);
int Size_LinkList(LinkList *list);
int Find_LinkList(LinkList *list, void* data);
void Print_LinkList(LinkList *list, PRINTLINKNODE print);
void *Front_LinkList(LinkList *list);
void FreeSpace_LinkList(LinkList *list);
#endif
#include "LinkList.h"
LinkList * Init_LinkList() {
LinkList *list = (LinkList*)malloc(sizeof(LinkList));
list->size = 0;
list->head = (LinkNode *)malloc(sizeof(LinkNode));
list->head->data = NULL;
list->head->next = NULL;
return list;
}
void Insert_LinkList(LinkList *list, int pos, void *data){
if(list == NULL) {
return;
}
if(data == NULL) {
return;
}
if(pos < 0 || pos > list->size) {
pos = list->size;
}
LinkNode *newnode = (LinkNode *)malloc(sizeof(LinkNode));
newnode->data = data;
newnode->next = NULL;
LinkNode *pCurrent = list->head;
for(int i = 0; i < pos; i++) {
pCurrent = pCurrent->next;
}
newnode->next = pCurrent->next;
pCurrent->next = newnode;
list->size++;
}
void RemoveByPos_LinkList(LinkList *list, int pos) {
if(list == NULL){
return;
}
if(pos < 0 || pos >= list->size){
return;
}
LinkNode *pCurrent = list->head;
for(int i = 0; i< pos; i++) {
pCurrent = pCurrent->next;
}
LinkNode *pDel = pCurrent->next;
pCurrent->next = pDel->next;
free(pDel);
list->size--;
}
int Size_LinkList(LinkList *list) {
return list->size;
}
int Find_LinkList(LinkList *list, void* data) {
if(list == NULL){
return -1;
}
if(data == NULL){
return -1;
}
LinkNode* pCurrent = list->head->next;
int i = 0;
while(pCurrent != NULL){
if(pCurrent->data == data){
break;
}
i++;
pCurrent = pCurrent->next;
}
return i;
}
void Print_LinkList(LinkList *list, PRINTLINKNODE print) {
if(list == NULL){
return;
}
LinkNode* pCurrent = list->head->next;
while(pCurrent != NULL){
print(pCurrent->data);
pCurrent = pCurrent->next;
}
}
void *Front_LinkList(LinkList *list) {
return list->head->next->data;
}
void FreeSpace_LinkList(LinkList *list) {
if(list == NULL){
return;
}
LinkNode *pCurrent = list->head;
while(pCurrent != NULL){
LinkNode *pNext = pCurrent->next;
free(pCurrent);
pCurrent = pNext;
}
free(list);
}
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "LinkList.h"
typedef struct PERSON {
char name[64];
int age;
int score;
} Person;
void MyPrint(void* data){
Person *p = (Person *)data;
printf("Name: %s Age: %d Score:%d \n", p->name, p->age, p->score);
}
int main(){
printf("link list test! \n");
LinkList *list = Init_LinkList();
Person p1 = {"jarvis",18,100};
Person p2 = {"zhangsan",19,99};
Person p3 = {"lishi",18,100};
Person p4 = {"wangwu",23,70};
Person p5 = {"zhaoliu",18,100};
Insert_LinkList(list, 0, &p1);
Insert_LinkList(list, 0, &p2);
Insert_LinkList(list, 0, &p3);
Insert_LinkList(list, 0, &p4);
Insert_LinkList(list, 0, &p5);
printf("--------------------\n");
Print_LinkList(list, MyPrint);
printf("--------------------\n");
printf("返回第一个结点\n");
Person *ret = (Person*)Front_LinkList(list);
printf("Name: %s Age: %d Score:%d \n", ret->name, ret->age, ret->score);
FreeSpace_LinkList(list);
system("pause");
return 0;
}
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 从 HTTP 原因短语缺失研究 HTTP/2 和 HTTP/3 的设计差异
· AI与.NET技术实操系列:向量存储与相似性搜索在 .NET 中的实现
· 基于Microsoft.Extensions.AI核心库实现RAG应用
· Linux系列:如何用heaptrack跟踪.NET程序的非托管内存泄露
· 开发者必知的日志记录最佳实践
· winform 绘制太阳,地球,月球 运作规律
· TypeScript + Deepseek 打造卜卦网站:技术与玄学的结合
· AI 智能体引爆开源社区「GitHub 热点速览」
· Manus的开源复刻OpenManus初探
· 写一个简单的SQL生成工具
2016-07-21 Objective-C中属性及其特质@property、attribute