线性表的顺序存储实现

SeqList.h头文件

//线性表的顺序存储实现

#ifndef SEQLIST_H_INCLUDE
#define SEQLIST_H_INCLUDE

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

typedef int ElementType;
#define MAXSIZE 10
#define ERROR -1

typedef int Position;    //这里的位置是数组的整型下标，从0开始
typedef struct LNode* PtrToNode;
struct LNode {
    ElementType Data[MAXSIZE];
    Position Last;            //数组中最后一个元素的下标
};
typedef PtrToNode List;

//生成一个空的顺序链表
List MakeEmpty();

//根据下标查找元素
ElementType FindElem(List L, int i);

//查找指定元素的下标
Position Find(List L, ElementType X);

//在第i个元素后插入X,即在下标为i - 1处插入X
bool Insert(List L, ElementType X,  int i);

bool Delete(List L, int i);

void PrintList(List L);

#endif

SeqList.c

#include "SeqList.h"

List MakeEmpty()
{
    List L;
    L = (List)malloc(sizeof(struct LNode));
    if (!L)
    {
        printf("memory has run out!
");
        return NULL;
    }
    L->Last = -1;
    return L;　　　　//L是一个结点指针，返回一个指针的拷贝，而不是整个顺序表的拷贝
}

ElementType FindElem(List L, int i)
{
    ElementType elem = -999;
    if (i < 1 || i > L->Last + 1)
    {
        printf("The Search failed. Please enter the correct value of i!
");
        return elem;
    }
    return L->Data[i];
}

Position Find(List L, ElementType X)
{
    Position i = 0;
    while (i <= L->Last && L->Data[i] != X)
        i++;
    if (i > L->Last)    return ERROR;        //如果没找到， 返回错误信息
    else
        return i;
}

bool Insert(List L, ElementType X, int i)
{
    Position j;
    if (L->Last + 1 == MAXSIZE)
    {
        printf("List is full! Insertion failed.
");
        return false;
    }
    if (i < 1 || i > L->Last + 2)        //检查插入位置的合法性：是否在1 ~ n + 1.n 为当前元素个数，即Last + 1
    {
        printf("ordinal illegality!
");
        return false;
    }
    for (j = L->Last; j >= i - 1; j--)
        L->Data[j + 1] = L->Data[j];
    L->Data[i - 1] = X;
    L->Last++;
    return true;

}

bool Delete(List L, int i)
{
    Position j;
    if (i < 1 || i > L->Last + 1)
    {
        printf("The bit order is out of range!
");
        return false;
    }
    for (j = i - 1; j < L->Last; j++)
        L->Data[j] = L->Data[j + 1];
    L->Last--;        //Last仍指向最后一个元素
    return true;
}

void PrintList(List L)
{
    int i;
    if (L->Last == -1)
    {
        printf("List is empty! Printing failed!
");
        return;
    }
    for (i = 0; i <= L->Last; i++)
        printf("%d ", L->Data[i]);
    printf("
");
}