线性表的链式存储

最新推荐文章于 2022-10-01 18:15:06 发布

5念since

最新推荐文章于 2022-10-01 18:15:06 发布

阅读量238

点赞数 1

分类专栏： # 数据结构文章标签：线性表链式存储

本文链接：https://blog.csdn.net/qq_31339221/article/details/54177300

版权

数据结构专栏收录该内容

13 篇文章 0 订阅

订阅专栏

#include <stdio.h>
#include <malloc.h>
#include "LinkList.h"

typedef struct _tag_LinkList
{
LinkListNode header;
int length;
}TLinkList;

LinkList* LinkList_Create()
{
TLinkList* ret = (TLinkList*)malloc(sizeof(TLinkList));

if( ret )
{
ret->header.next = NULL;
ret->length = 0;
}

return ret;
}

void LinkList_Destroy(LinkList* list)
{
free(list);
}

void LinkList_Clear(LinkList* list)
{
TLinkList* sList = (TLinkList*)list;

if( sList != NULL)
{
sList->header.next = NULL;
sList->length = 0;
}
}

int LinkList_Length(LinkList* list)
{
TLinkList* sList = (TLinkList*)list;
int ret = -1;

if( sList != NULL)
{
ret = sList->length;
}

return ret;
}

LinkListNode* LinkList_Delete(LinkList* list,int pos)
{
TLinkList* sList = (TLinkList*)list;
LinkListNode* ret = NULL;
int i = 0;

if( (sList != NULL) && (pos >= 0) && (pos < sList->length) )
{
LinkListNode* current = (LinkListNode*)sList;

for(i=0;i<pos;i++)
{
current = current->next;
}

ret = current->next;
current->next = ret->next;

sList->length--;
}

return ret;
}

int LinkList_Insert(LinkList* list,LinkListNode* node,int pos)
{
TLinkList* sList = (TLinkList*)list;
int ret = ((sList != NULL) && (pos >= 0) && (node != NULL));
int i = 0;

if( ret )
{
LinkListNode* current = (LinkListNode*)sList;

for(i=0;(i<pos)&&(current->next != NULL);i++)
{
current = current->next;
}

node->next = current->next;
current->next = node;

sList->length++;
}

return ret;
}

LinkListNode* LinkList_Get(LinkList* list,int pos)
{
TLinkList* sList = (TLinkList*)list;
LinkListNode* ret = NULL;
int i = 0;

if( (sList != NULL) && (pos >= 0) && (pos < sList->length) )
{
LinkListNode* current = (LinkListNode*)sList;

for(i=0;i<pos;i++)
{
current = current->next;
}

ret = current->next;
}

return ret;
}