C语言创建线性顺序表

 

#include <stdio.h>
#include <stdlib.h>
#define MAXSIZE 100

typedef struct 
{
    int *elem;
    int length;
}SqList;

int InitList(SqList *L)
{
    L->elem=(int*)malloc(sizeof(int)*MAXSIZE);
    if(!L->elem){return 0;}
    L->length=0;
    return 1;
}

int GetElem(SqList L,int i,int *e)  //判断指定位置i的值是否合理
{
    if(i<1||i>L.length) {return 0;}
    *e=L.elem[i-1];
    return *e;
}

int LocateElem(SqList L,int e)   //查找值为e的数据元素，返回其序号
{
    int i;
    for(i=0;i<L.length;i++){
        if(L.elem[i]==e)return i+1;
    }
    return 0;
}

int ListInsert(SqList *L,int i,int e)
{

    if(i<1||i>L->length+1) return 0;
    if(L->length==MAXSIZE) return 0;
    for (int j=L->length-1;j>=i-1;j--)
    {
        L->elem[j+1]=L->elem[j];
        
    }
    L->elem[i-1]=e;
    return 1;
}

int main(){
    SqList Line;
    InitList(&Line);
    Line.elem[3]=6;
    Line.length=8;
    int a=0;
    printf("search%d",GetElem(Line,4,&a));
    printf("insert%d",ListInsert(&Line,5,6));
    return 0;

}