顺序表动态建立

#include <stdio.h>
#include <stdlib.h>
#include <windows.h>
#define N 100
#define OVERFLOW 0
#define OK 1

typedef struct sqlist
{
    int data[N];
    int length;
}sqlist,*LinkList;

void InsertList(struct sqlist *l, int m, int i)
{
    int j;
    if(i<0 && i>l->length)
    {
        printf("position error!");
        exit(1);
    }
    if(l->length > N){
        printf("overflow");
        exit(1);
    }
    for(j=l->length-1; j>=i; j--)
    {
        l->data[j+1] = l->data[j];
    }
    l->data[i] = m;
    l->length++;
}

int main()
{
    struct sqlist *sq;
    int i,n,t;
    sq = (struct sqlist*)malloc(sizeof(sqlist));  //storage allocation
    sq->length = 0;
    printf("please input the size of sqlist: \n");
    scanf("%d", &n);
    printf("please input the elements of the lise:\n");
    for(i=0; i<n; i++)
    {
        scanf("%d",&t);
        InsertList(sq,t,i);
    }printf("Now the list is:\n");
    for(i=0; i<sq->length; i++)
    {
        printf("%d ", sq->data[i]);
    }
    return 0;
}