前言:
本文是在学习了线性表的实现,理解国嵌数据结构与算法教程后,自己实现的线性表这种简单的数据结构,并且是可复用于任意类型数据;
// SeqList.h
#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();
int SeqList_Length();
int SeqList_Capacity(SeqList* list);
int SeqList_Insert(SeqList* list, int pos, SeqListNode* node);
SeqListNode* SeqList_Get(SeqList* list, int pos);
SeqListNode* SeqList_Delete(SeqList* list, int pos);
#endif
// SeqList.c
#include"SeqList.h"
#include<stdio.h>
#include<malloc.h>
typedef unsigned int TSeqListNode;
typedef struct tag_SeqList
{
int capacity;