严蔚敏数据结构C语言版——线性表（初始化、插入、删除、遍历）

#include<stdio.h>
#include<malloc.h>
#include<stdlib.h>

#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2

#define LIST_INIT_SIZE 100          //存储空间初始分配量
#define LISTINCREMENT 10            //存储空间不够时，动态增加的分配量

typedef int ElemType;
typedef int Status;

typedef struct {
    ElemType *elem;         //存储空间基地址
    int length;             //当前长度
    int listsize;           //当前分配的存储容量，即有多少个ElemType空间
}SqList;

Status InitList_Sq(SqList *L);          //初始化线性表
Status ListInsert_Sq(SqList *L,int i,ElemType e);           //插入操作
Status ListDelete_Sq(SqList *L,int i,ElemType *e);          //删除操作
void TraverseList_Sq(SqList L);         //遍历线性表

int main()
{
    SqList L;
    ElemType e;
    int i,n = 10;
    InitList_Sq(&L);
    for(i= 1; i <= n; i++)
    {
        ListInsert_Sq(&L,i,i);           //插入10个元素,1,2,3,...,10
    }
    TraverseList_Sq(L);

    printf("输入要删除的位置：");
    scanf("%d",&i);
    ListDelete_Sq(&L,i,&e);
    TraverseList_Sq(L);
    printf("e=%d\n",e);

    printf("输入要插入的位置和数值：");
    scanf("%d %d",&i,&e);
    ListInsert_Sq(&L,i,e);
    TraverseList_Sq(L);
    return 0;
}

Status InitList_Sq(SqList *L)
{
    //分配存储空间100*sizeof(ElmeType),并把存储空间基地址返回给L->elem
    L->elem = (ElemType *)malloc(LIST_INIT_SIZE*sizeof(ElemType));
    if(!L->elem) exit(OVERFLOW);
    L->length = 0;
    //初始化存储空间容量为100
    L->listsize = LIST_INIT_SIZE;
    return OK;
}

//在第i个位置前，插入新元素，i是从1开始变化的
Status ListInsert_Sq(SqList *L,int i,ElemType e)
{
    //插入位置不合理
    if(i < 1 || i> L->length+1) return ERROR;
    //存储空间不足，增加分配
    if(L->length >= L->listsize )
    {
        ElemType *newbase = (ElemType *) realloc (L->elem,
                                        (L->listsize + LISTINCREMENT)*sizeof(ElemType));
        if(!newbase) exit(OVERFLOW);
        L->elem = newbase;
        L->listsize += LISTINCREMENT;
    }
    ElemType *q = &(L->elem[i-1]);
    ElemType *p;
    for(p = &(L->elem[L->length-1]); p >= q; --p)
    {
        *(p+1)=*p;
    }
    *q = e;
    (L->length)++;
    return OK;
}

Status ListDelete_Sq(SqList *L,int i,ElemType *e)
{
    //删除位置不合理
    if(i < 1 || i > L->length) return ERROR;
    ElemType *p = &(L->elem[i-1]);
    *e = *p;
    ElemType *q = &(L->elem[L->length-1]);
    for(++p; p <= q; p++)
    {
        *(p-1) = *p;
    }
    (L->length)--;
    return OK;
}

void TraverseList_Sq(SqList L)
{
    int i;
    printf("线性表元素为：");
    for(i = 0; i <= L.length-1; i++)
    {
        printf("%d,",L.elem[i]);
    }
    printf("\n");
}