内容过程中中，把内容过程中较好的内容段做个珍藏，如下内容段是关于C++顺序存储的线性表的内容，希望对各位有所帮助。

创新互联专业提供成都主机托管四川主机托管成都服务器托管四川服务器托管，支持按月付款！我们的承诺：贵族品质、平民价格，机房位于中国电信/网通/移动机房，服务器托管服务有保障！

#include 

#define OK 1
#define ERR 0

#define LIST_INIT_SIZE 100
#define LIST_INCREMENT 10
#define ElemType char

typedef struct {
} SqList;

{
    if(NULL == aList->elem)return ERR;
    aList->listSize = LIST_INIT_SIZE;
    aList->length = 0;
    return OK;
}

{
    int i;
    if( index<0 || index>aList->length ){
        printf("Error : Insert %c to wrong position %dn",e,index);
    }
    if( aList->listSize <= aList->length )
    {
        if(NULL == aList->elem) return ERR;
        aList->listSize += LIST_INCREMENT;
    }

    printf("Insert %c to position %dn",e,index );
    i = aList->length;
    while(i>index)
    {
        aList->elem[i] = aList->elem[i-1];
        i--;
    }

    aList->elem[index] = e;
    aList->length++;

    return OK;
}

{
    int i = index;
    if(i<0 || i>=aList->length)return ERR;

    i = index;
    while(ilength-1)
    {
        aList->elem[i] = aList->elem[i+1];
        i++;
    }
    aList->length--;

    return OK;
}

int ListTraverse(SqList aList)
{
    int i=0;
    while(i < aList.length){
        printf("%ct",aList.elem[i]);
        i++;
    }
    printf("n");
    return OK;
}

{
    SqList aList ;
    char element;
    int position;

    InitList( &aList );

    while(1){
        printf("Please input element and position to insert in (input ; to quit) :n");
        scanf("%1s,%d",&element,&position);
        if(';' == element) break;
        ListInsert(&aList,element,position);
    }

    ListDelete(&aList,&element,0);

    ListTraverse(aList);

    printf("length :%d . n",aList.length);
    return OK;
}

分享名称：C++顺序存储的线性表的代码
本文地址：http://kswsj.cn/article/piipic.html