3.【数据结构】写一个线性表

验证插入函数 

SeqList.c

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

typedef unsigned int TSeqListNode; //数据元素的类型 
 
typedef struct _tag_TSeqList //结构体 
{
	int capacity;
	int length;
	TSeqListNode* node;   //定义一个指针动态申请数组的空间 
}TSeqList;

SeqList* SeqList_Create(int capacity) //创建最大容量为capacity的顺序表 
{
	TSeqList* ret = NULL;
	
	if(capacity >=0)
	{
		ret = (TSeqList*)malloc(sizeof(TSeqList)+sizeof(TSeqListNode) * capacity); 	
	}   //TSeqList的大小+真正数组空间的大小 
	
	if(ret != NULL) //判断空间申请是否成功 
	{
		ret->capacity = capacity;
		ret->length = 0;
		ret->node = (TSeqListNode*)(ret+1);  //node指向头位置	
	}
	
	return ret; //返回值是个指针 
}

void SeqList_Destroy(SeqList* list)
{
	free(list);
}

void SeqList_Clear(SeqList* list)
{
	TSeqList* sList=(TSeqList*)list;   //强制类型转换 
	
	if(sList !=NULL)
	{
		sList->length =0;	
	}
}

int SeqList_Length(SeqList* list)
{
	TSeqList*