1） 链表--顺序存储结构

#include <iostream>
using namespace std;

typedef void Seqlist;
typedef void SeqlistNode;

typedef struct
{
    int length;
    int capacity;
    unsigned int *node;// 为了动态化节点。
}TSeqList;

Seqlist* SqList_Create(int capacity)//分配空间
{
    int ret=0;
    TSeqList *tmp=NULL;

    tmp=(TSeqList*)malloc(sizeof(TSeqList));//分配空间
    if(tmp=NULL)
    {
        ret=-1;
        cout<<"func SqList_Create() err: "<<ret<<endl;
        return NULL;
    }

    memset(tmp,0,sizeof(TSeqList));

    //根据capacity的大小分配节点的空间
    tmp->node=(unsigned int*) malloc(sizeof(unsigned int*)*capacity);
    if(tmp=NULL)
    {
        ret=-2;
        cout<<"func SqList_Create() : malloc err  "<< ret<<endl;
        return NULL;
    }
    return tmp;
}

void SeqList_Destory (Seqlist* list)//释放内存空间
{
    TSeqList *tList=NULL;
    if(list=NULL)
        return ;
    tList=(TSeqList *) list;

    if(tList->node!=NULL)
    {
        free (tList->node);
    }
    free(tList);
    return;
}

//清空链表---回到初始化状态  链表长度==0
void SeqList_Clear(Seqlist *list)
{
    TSeqList *tList=NULL;
    if(list=NULL)
        return ;
    tList=(TSeqList *) list;

    tList->length=0;
    return;
}

int SeqList_Length(Seqlist *list)//链表的实际长度
{
    TSeqList *tList=NULL;
    if(list=NULL)
        return -1 ;
    tList=(TSeqList *) list;

    return tList->length;
}

int SeqList_Capacity(Seqlist *list)//链表的容量
{
    TSeqList *tList=NULL;
    if(list=NULL)
        return -1 ;
    tList=(TSeqList *) list;

    return tList->capacity;
}

int  SeqList_Insert(Seqlist *list,SeqlistNode *node,int pos)
{
    int ret=-1;
    int i=0;
    TSeqList *tList=NULL;
    if(list==NULL||node==NULL||pos<0)
    {
        cout<<"func SqList_Create() : malloc err  "<< ret<<endl;
        return ret;
    }

    tList=(TSeqList *)list;

    //判断是不是满了
    if(tList->length>=tList->capacity)
    {
        ret=-2;
        cout<<"func SqList_Create() : malloc err  "<< ret<<endl;
        return ret;
    }

    //容错修正 6个长度 容量20；用户pos10位置插入
    if(pos>=tList->length)
    {
        pos=tList->length;
    }

    //元素后移
    for( i=tList->length;i>pos;i--)
    {
        tList->node[i]=tList->node[i-1];
    }
    //插入元素
    tList->node[i]=(unsigned int) node;
    return 0;
}

int Seqlist_get(Seqlist* list,int pos)
{
    int ret=-1;
    int i=0;
    TSeqList *tList=NULL;
    if(list==NULL||pos<0)
    {
        cout<<"func SqList_Create() : malloc err  "<< ret<<endl;
        return -1;
    }
    tList=(TSeqList *)list;
    tList->length++;

    return (unsigned)tList->node[pos];
}