SeqList 简单的线性表实现
Posted randyniu
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了SeqList 简单的线性表实现相关的知识,希望对你有一定的参考价值。
用数据来实现顺序链表,将上层逻辑和底层链表的实现进行了分离,底层用void指针来满足所有类型的数据元素,上层需要传递对应的元素类型,并分配内存空间,底层不进行内存的管理工作。
// 接口
#ifndef _SEQLIST_H__ #define _SEQLIST_H__ typedef void SeqList; typedef void SeqListNode; //链表 创建 SeqList* SeqList_Create(int capacity); //链表 销毁 void SeqList_Destroy(SeqList* list); ////链表 清空 void SeqList_Clear(SeqList* list); //链表 长度 int SeqList_Length(SeqList* list); //链表 容量 int SeqList_Capacity(SeqList* list); //链表 在某一个位置 插入元素 int SeqList_Insert(SeqList* list, SeqListNode* node, int pos); //获取某一个位置的链表结点 SeqListNode* SeqList_Get(SeqList* list, int pos); //删除某一个位置的结点 SeqListNode* SeqList_Delete(SeqList* list, int pos); #endif //__SEQLIST_H__
#include <stdlib.h> #include <string.h> #include <stdio.h> #include "seqlist.h" //用数组来模拟线性表 typedef struct _tag_SeqList { int capacity; //存放构造链表时候的数据容量。 int length; // 存放链表中实际的数量。 int **node; //用来存放每个链表的数据地址。 }TSeqList; //链表 创建 SeqList* SeqList_Create(int capacity) //O(1) { int ret; TSeqList *tmp = NULL; tmp = (TSeqList *)malloc(sizeof(TSeqList)); if (tmp == NULL) { ret = 1; printf("func SeqList_Create() err :%d ", ret); return NULL; } memset(tmp, 0, sizeof(TSeqList)); tmp->capacity = capacity; tmp->length = 0; tmp->node = (int **)malloc(sizeof(void *) * capacity); if (tmp->node == NULL) { ret = 2; printf("func SeqList_Create() malloc err :%d ", ret); return NULL; } memset(tmp->node, 0, sizeof(void *) * capacity); return tmp; } //链表 创建 int SeqList_Create2(int capacity, SeqList**handle) { int ret = 0; TSeqList *tmp = NULL; tmp = (TSeqList *)malloc(sizeof(TSeqList)); if (tmp == NULL) { ret =1; printf("func SeqList_Create2() err :%d ", ret); return ret; } memset(tmp, 0, sizeof(TSeqList)); tmp->capacity = capacity; tmp->length = 0; tmp->node = (int **)malloc(sizeof(void *) * capacity); if (tmp->node == NULL) { ret = 2; printf("func SeqList_Create2() malloc err :%d ", ret); return ret; } *handle = tmp; return ret; } //链表 销毁 void SeqList_Destroy(SeqList* list) //O(1) { TSeqList *tmp = NULL; if (list == NULL) { return ; } tmp = (TSeqList *)list; if (tmp->node != NULL) { free(tmp->node); } free(tmp); return ; } //链表 清空 void SeqList_Clear(SeqList* list) //O(1) { TSeqList *tmp = NULL; if (list == NULL) { return ; } tmp = (TSeqList *)list; tmp->length = 0; memset(tmp->node, 0, (tmp->capacity * sizeof(void *)) ); return ; } //链表 长度 int SeqList_Length(SeqList* list) //O(1) { TSeqList *tmp = NULL; if (list == NULL) { return -1; } tmp = (TSeqList *)list; return tmp->length; } //链表 容量 int SeqList_Capacity(SeqList* list) //O(1) { TSeqList *tmp = NULL; if (list == NULL) { return -1; } tmp = (TSeqList *)list; return tmp->capacity; } //链表 在某一个位置 插入元素 int SeqList_Insert(SeqList* list, SeqListNode* node, int pos) //O(n) { TSeqList *tList = NULL; int i = 0; if (list == NULL || node==NULL) { return -1; } tList = (TSeqList *)list; //如果满了 if (tList->length >= tList->capacity) { return -2; } //pos位置的容错处理 if (pos > tList->length ) { pos = tList->length; } for (i=tList->length; i>pos; i--) //n { tList->node[i] = tList->node[i-1]; } tList->node[i] = (int* )node; //ok tList->length ++; return 0; } //获取某一个位置的链表结点 SeqListNode* SeqList_Get(SeqList* list, int pos) //O(1) { TSeqList *tList = NULL; SeqListNode *tmp = NULL; tList = (TSeqList *)list; if (list == NULL || pos < 0 || pos >= tList->length ) { return NULL; } tmp = tList->node[pos]; return tmp; } //删除某一个位置的结点 SeqListNode* SeqList_Delete(SeqList* list, int pos) ////O(n) { int i = 0; TSeqList *tList = NULL; SeqListNode *tmp = NULL; tList = (TSeqList *)list; if (list == NULL || pos <0 || pos >= tList->length) { return NULL; } tmp = tList->node[pos]; // pos = 3 for (i=pos+1; i<tList->length; i++) { tList->node[i-1] = tList->node[i]; } tList->length --; return tmp; }
优缺点和明显,查找循序,插入和删除需要移动所有的元素。
以上是关于SeqList 简单的线性表实现的主要内容,如果未能解决你的问题,请参考以下文章