线性表-顺序存储结构(C语言实现)

线性表-顺序存储结构(C语言实现)

参考：大话数据结构（程杰）
博客：http://cj723.cnblogs.com/
豆瓣：https://book.douban.com/subject/6424904/

主要包括：
- 列表定义
- 判断列表是否为空
- 初始化列表
- 打印列表
- 清空列表
- 得到第i个位置元素
- 元素定位
- 列表第i个元素插入
- 列表第i个元素删除
- 计算列表长度

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

#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
typedef int Status;

#define MAXSIZE 100
typedef int ElemType;

typedef struct {
    ElemType data[MAXSIZE];
    int length;
}SqList;


int EmptyList(SqList L)
{
    if (!&L)
        return ERROR;

    if (L.length == 0)
        return 1;
    return 0;
}

Status InitList(SqList *L)
{
    int i, length;
    printf("Input the length of List: ");
    scanf("%d", &length);
    if (length >= 0 && length <= MAXSIZE)
        L->length = length;
    else
        return ERROR;
    for (i = 0; i < L->length; i++)
        scanf("%d", &L->data[i]);
    return OK;
}

Status PrintList(SqList L)
{
    if (! &L)
        return ERROR;

    if (EmptyList(L))
        printf("List is empty!\n");
    else
    {
        int i;
        for (i = 0; i < L.length; i++)
            printf("%d\t", L.data[i]);
        printf("\n");
    }
    return OK;
}

Status ClearList(SqList *L)
{
    if (L->length < 0 || L->length > MAXSIZE)
        return ERROR;
    L->length = 0;
    return OK;
}

Status GetElem(SqList L, int i, ElemType *e)
{
    if (L.length==0 || i < 1 || i > L.length)
        return ERROR;
    else
        *e = L.data[i - 1];
    return OK;
}

int LocateElem(SqList L, ElemType e)
{
    if (L.length < 0 || L.length>MAXSIZE)
        return ERROR;
    int k;
    for (k = 1; k <= L.length; k++)
        if (L.data[k-1] == e)
            return k;
    return 0;
}

Status ListInsert(SqList *L, int i, ElemType e)
{
    if (L->length >= MAXSIZE)
        return ERROR;
    if (i < 1 || i > L->length + 1)
        return ERROR;
    int k;
    if (i <= L->length)
    {
        for (k = L->length; k >= i; k--)
            L->data[k] = L->data[k - 1];
    }
    L->data[i - 1] = e;
    L->length++;
    return OK;
}

Status ListDelete(SqList *L, int i, ElemType *e)
{
    if (L->length == 0)
        return ERROR;
    if (i<0 || i>L->length)
        return ERROR;
    *e = L->data[i - 1];
    int k;
    if (i < L->length)
    {
        for (k = i; k < L->length; k++)
            L->data[k - 1] = L->data[k];
    }
    L->length--;
    return OK;
}

int ListLength(SqList L)
{
    if (L.length<0 || L.length>MAXSIZE)
        return ERROR;
    return L.length;
}


int main()
{
    SqList *L;
    L = (SqList*)malloc(sizeof(SqList));
    InitList(L);
    PrintList(*L);
    ClearList(L);
    PrintList(*L);
    /* Test GetElem
    int i = 2;
    ElemType *e;
    e = (ElemType*)malloc(sizeof(ElemType));
    GetElem(*L, i, e);
    printf("The %dth element is: %d\n", i, *e); */

    /* Test LocateElem
    int i = 2;
    ElemType e=3;
    int loc = LocateElem(*L, e);
    printf("The location of %d is: %d\n", e, loc);*/

    /* Test ListInsert
    int i = 2;
    ElemType e = 5;
    ListInsert(L, i, e);
    PrintList(*L);*/

    /* Test ListDelete
    int i = 2;
    ElemType *e;
    e = (ElemType*)malloc(sizeof(ElemType));
    ListDelete(L, i, e);
    PrintList(*L);*/
    return 0;
}