顺序表C语言版

#include <stdio.h>
/*
 * 顺序表最多输入N个数
 */
#define N 10
#define OK 1
#define ERROR -1


struct sequeuelist {
    int *elem;
    int length;
    int listsize;
};
/*
 * 因为l是指针，所以请注意->的使用，而不是L.
 */
int sequeuelist_init(struct sequeuelist *l) {
    l->elem = (int *)malloc(N * sizeof(int));
    if (!l->elem) {
        return ERROR;
    }
    l->length = 0;/* 空表长度为0 */
    l->listsize = N;/* 初始存储容量 */
    return OK;
}
/*
 * 插入函数，在实验时，可暂不考虑空间不足的情况
 */
int sequeuelist_insert(struct sequeuelist *l, int i, int e) {
    int *q = NULL;
    int *p = NULL;
    q = &(l->elem[i-1]);
    for (p = &(l->elem[l->length]); p > q; --p) {
        *(p+1) = *p;
    }
    *q = e;
    l->length++;
    return OK;
}
/*
 * 输出顺序表所有结点的值
 */
int sequeuelist_print(struct sequeuelist *l) {


    int *start = NULL;
    int *stop = NULL;

    stop = &(l->elem[l->length]);
    for (start = &(l->elem[0]); start< stop; start++) {
        printf("%d	", *start);
    }
    printf("
");
}

/*
 * 顺序表l,从第i各元素起，连续删除k个元素。
 */
int sequeuelist_delete_ith_to_kth(struct sequeuelist *l, int i, int k)
{
        int *p = NULL;/*如果p为指向struct squeue的指针类型，则p++后，p增加的是struct squeue类型成员的长度*/
        int *q = NULL;
        int *r = NULL;
        int length_temp = l->length-1;
        p = &(l->elem[i-1]);
        r = &(l->elem[length_temp]);
        for (q = &(l->elem[i+k-1]); q <= &(l->elem[length_temp]); /*q++*/) {
                *(p++) = *q;
                q++;
                l->length--;
        }

        return OK;
}
/*
 *
 */
int main(void) {
    int i;
    int e;
    int n = 10;
    struct sequeuelist *l = NULL;
    struct sequeuelist M;
    l = &M;

    sequeuelist_init(l);
    printf("Please input n numbers:
");
    /*
     * 由于线性表的下标是从0开始的
     */
    for (i = 1; i <= n; i++) {/* 创建初始的顺序表，包含n个数 */
        scanf("%d", &e);
        sequeuelist_insert(l, i, e);
    }
    sequeuelist_print(l);/*输出各结点的值*/
    ///*
    //sequeuelist_insert(l, 3, 999);/*在第三个元素前插入999*/
    //printf("After insert:
");
    //*/
    //sequeuelist_print(M);/*输出插入后各结点的值*/
    sequeuelist_delete_ith_to_kth(l, 3, 4);
    sequeuelist_print(l);
    return 0;
}