顺序表

#define   _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include "seqlist.h"
using namespace std;
typedef struct Teacher
{
int age;
char name[64];
}Teacher;

//测试框架
void main()
{
int ret = 0;
SeqList* list = NULL;
int capacity=10;
Teacher t1, t2, t3, t4, t5;
t1.age = 20;
t2.age = 21;
t3.age = 25;
t4.age = 26;
t5.age = 23;
//创建链表
list = SeqList_Create(capacity);
if (list==NULL)
{
cout << "SeqList_Create() err" << endl;
//return NULL;
}
//插入值
{
ret=SeqList_Insert (list, (SeqListNode*)&t1, 0);//头插法
ret = SeqList_Insert(list, (SeqListNode*)&t2, 0);//头插法
ret = SeqList_Insert(list, (SeqListNode*)&t3, 0);//头插法
ret = SeqList_Insert(list, (SeqListNode*)&t4, 0);//头插法
ret = SeqList_Insert(list, (SeqListNode*)&t5, 0);//头插法
}
//遍历链表
{
for (int i = 0; i < SeqList_Length(list);i++)
{
Teacher *temp = (Teacher*)SeqList_Get(list,i);
if (temp == NULL)
{
cout << "SeqList_Get() err" << endl;
}
cout << "age " << temp->age << endl;
}


}
//删除链表中的节点
while (SeqList_Length(list)>0)
{
SeqList_Delete(list,0);
}
    system("pause");

}

SeqList.h

#pragma  once
#define   _CRT_SECURE_NO_WARNINGS
#ifndef   _HV_SEQLIST_H_
#define  _HV_SEQLIST_H_
typedef void SeqList;
typedef void SeqListNode;
SeqList* SeqList_Create(int capacity);
int  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.cpp

#include "seqlist.h"
#include <iostream>
using namespace std;
//结构体中的一级指针
typedef struct  _tag_SeqList
{
int length;
int capacity;//总个数
unsigned int *node;
}TSeqList;


SeqList* SeqList_Create(int capacity)
{
TSeqList *temp = NULL;
temp = (TSeqList*)malloc(sizeof(TSeqList));
if (temp==NULL)
{
cout << "malloc err" << endl;
return NULL;
}
memset(temp, 0, sizeof(TSeqList));
//根据参数分配内存
temp->node = (unsigned int *)malloc(capacity*sizeof(unsigned int));
if (temp->node==NULL)
{
cout << "temp->node = (unsigned int *)malloc(capacity*sizeof(unsigned int)) err" << endl;
}
temp->capacity = capacity;
temp->length = 0;
return temp;
}


int SeqList_Destroy(SeqList* list)
{
TSeqList *temlist = NULL;
if (list==NULL)
{
return -1;
}
temlist = (TSeqList*)list;
if (temlist!=NULL)
{
free(temlist->node);
}
free(temlist);
return 0;


}
//把数据长度清空
void SeqList_Clear(SeqList* list)
{
TSeqList *temlist = NULL;
if (list == NULL)
{
return ;
}
temlist = (TSeqList*)list;
temlist->length = 0;
return;
}


int SeqList_Length(SeqList* list)
{
TSeqList *temlist = NULL;
if (list == NULL)
{
return -1;
}
temlist = (TSeqList*)list;
return temlist->length;
}




int SeqList_Capacity(SeqList *list)
{
TSeqList *temlist = NULL;
if (list == NULL)
{
return -1;
}
temlist = (TSeqList*)list;
return temlist->capacity;
}






int SeqList_Insert(SeqList* list, SeqListNode* node, int pos)
{
TSeqList *templist = NULL;
if (list==NULL||node==NULL||pos<0)
{
return -1;
cout << "if (list==NULL||node==NULL)" << endl;
}
templist = (TSeqList*)list;
//判断是否满了
if (templist->length>=templist->capacity)
{
cout << "templist->length=templist->capacity err" << endl;
return -2;
}
//如果只有六个元素 容量是20 使用者要在10的位置插入
if (templist->capacity < pos)
{
//templist->node[templist->capacity] = pos;
templist->length = pos;
}
//元素后移
for (int i = templist->length; i > pos;i--)
{
templist->node[i] = templist->node[i-1];
}
//插入节点
templist->node[pos] = (unsigned int)node;
templist->length++;
return 0;
}


SeqListNode* SeqList_Get(SeqList* list, int pos)
{
unsigned int  ret;
TSeqList *templist = NULL;
if (list == NULL||pos<0)
{
return NULL;
cout << "if (list==NULL||node==NULL)" << endl;
}
templist = (TSeqList*)list;
ret=templist->node[pos];
return (void*)ret;
}


SeqListNode* SeqList_Delete(SeqList* list, int pos)
{
unsigned int  ret;
TSeqList *templist = NULL;
if (list == NULL||pos<0)
{
return NULL;
cout << "if (list==NULL||node==NULL)" << endl;
}
templist = (TSeqList*)list;


ret = templist->node[pos];


for (int i = pos; i < templist->length;i++)
{
templist->node[i - 1] = templist->node[i];
}
templist->length--;
return (SeqListNode*)ret;
}