顺序表演示

#include <stdio.h>
#include <malloc.h>

#define LIST_MAX 10

typedef struct List {
    int Length;//当前长度
    int data[LIST_MAX];//顺序表
} *ListPtr;//对应的结构体指针


//遍历顺序表
void outputList(ListPtr list) {
    int len = list->Length;
    for (int i = 0; i < len; i++) {
        printf("%d ", list->data[i]);
    }
    printf("\r\n");
}


void outputMemory(ListPtr listPtr) {
    printf("The address of the structure: %d\r\n", listPtr);
    printf("The address of actualLength: %d\r\n", &listPtr->Length);
    printf("The address of data: %d\r\n", &listPtr->data);
    printf("The address of actual data: %d\r\n", &listPtr->data[0]);
    printf("The address of second data: %d\r\n", &listPtr->data[1]);
}


//初始化顺序表
ListPtr sequentialListInit(int paraData[], int len) {
    ListPtr resultPtr = (ListPtr)malloc(sizeof(struct List));//开辟节点空间
    for (int i = 0; i < len; i++) {
        resultPtr->data[i] = paraData[i];
    }
    resultPtr->Length = len;

    return resultPtr;
}

void sequentialListInsert(ListPtr paraListPtr, int paraPosition, int paraValue) {
    
    if (paraListPtr->Length >= LIST_MAX) {
        printf("Cannot insert element: list full.\r\n");
        return;
    }

    if (paraPosition < 0) {
        printf("Cannot insert element: negative position unsupported.");
        return;
    }
    if (paraPosition > paraListPtr->Length) {
        printf("Cannot insert element: the position %d is bigger than the list length %d.\r\n", paraPosition, paraListPtr->Length);
        return;
    }

    for (int i = paraListPtr->Length; i > paraPosition; i--) {
        paraListPtr->data[i] = paraListPtr->data[i - 1];
    }

    paraListPtr->data[paraPosition] = paraValue;

    paraListPtr->Length++;
}


void sequentialInsertTest() {
    int i;
    int tempArray[5] = { 3, 5, 2, 7, 4 };

    printf("---- sequentialInsertTest begins. ----\r\n");

    ListPtr tempList = sequentialListInit(tempArray, 5);
    printf("After initialization, the list is: ");
    outputList(tempList);

    printf("Now insert to the first, the list is: ");
    sequentialListInsert(tempList, 0, 8);
    outputList(tempList);

    printf("Now insert to the last, the list is: ");
    sequentialListInsert(tempList, 6, 9);
    outputList(tempList);

    printf("Now insert beyond the tail. \r\n");
    sequentialListInsert(tempList, 8, 9);
    printf("The list is:");
    outputList(tempList);

    for (i = 0; i < 5; i++) {
        printf("Inserting %d.\r\n", (i + 10));
        sequentialListInsert(tempList, 0, (i + 10));
        outputList(tempList);
    }

    printf("---- sequentialInsertTest ends. ----\r\n");
}

int sequentialListDelete(ListPtr paraListPtr, int paraPosition) {

    if (paraPosition < 0) {
        printf("Invalid position: %d.\r\n", paraPosition);
        return -1;
    }

    if (paraPosition >= paraListPtr->Length) {
        printf("Cannot delete element: the position %d is beyond the list length %d.\r\n", paraPosition, paraListPtr->Length);
        return -1;
    }

    int resultValue = paraListPtr->data[paraPosition];
    for (int i = paraPosition; i < paraListPtr->Length; i++) {
        paraListPtr->data[i] = paraListPtr->data[i + 1];
    }

    paraListPtr->Length--;

    return resultValue;
}
void sequentialDeleteTest() {
    int tempArray[5] = { 3, 5, 2, 7, 4 };

    printf("---- sequentialDeleteTest begins. ----\r\n");

    ListPtr tempList = sequentialListInit(tempArray, 5);
    printf("After initialization, the list is: ");
    outputList(tempList);

    printf("Now delete the first, the list is: ");
    sequentialListDelete(tempList, 0);
    outputList(tempList);

    printf("Now delete the last, the list is: ");
    sequentialListDelete(tempList, 3);
    outputList(tempList);

    printf("Now delete the second, the list is: ");
    sequentialListDelete(tempList, 1);
    outputList(tempList);

    printf("Now delete the 5th, the list is: ");
    sequentialListDelete(tempList, 5);
    outputList(tempList);

    printf("Now delete the (-6)th, the list is: ");
    sequentialListDelete(tempList, -6);
    outputList(tempList);

    printf("---- sequentialDeleteTest ends. ----\r\n");

    outputMemory(tempList);
}


int locateElement(ListPtr paraListPtr, int paraValue) {
    int len = paraListPtr->Length;
    for (int i = 0; i < len; i++) {
        if (paraListPtr->data[i] == paraValue) {
            return i;
        }
    }
    return -1;
}

int getElement(ListPtr paraListPtr, int paraPosition) {
    if (paraPosition < 0 || paraPosition >= paraListPtr->Length) {
        printf("IndexOutOfBoundsException.\r\n");
        return -1;
    }
    return paraListPtr->data[paraPosition];
}

void clearList(ListPtr paraListPtr) {
    //paraListPtr->Length = 0;
    free(paraListPtr);
}

void main() {
    sequentialInsertTest();
    sequentialDeleteTest();
}

深入理解顺序表的逻辑结构、物理结构等概念，掌握顺序表基本操作的编程实现，注意顺序表插入、删除等操作过程中数据元素的移动现象。编写程序时，要考虑程序的健壮性，熟练掌握通过函数参数返回函数结果的办法。