数据结构：顺序表

代码 

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

#define  LIST_MAX_LENGTH 10

typedef struct SequentialList {
    int actualLength;//用于存储当前列表中的元素数量

    int data[LIST_MAX_LENGTH];
}*SequentialListPtr;

void outputList(SequentialListPtr paraList) {
    for (int i = 0; i < paraList->actualLength; i++) {
        printf("%d", paraList->data[i]);
    }
    printf("\r\n");
}//为顺序表提供了输出功能

void outputMemory(SequentialListPtr paraListPtr) {
    printf("The address of the structure: %ld\r\n",paraListPtr);
    printf("The address of the actualLength: %ld\r\n",&paraListPtr->actualLength);
    printf("The address of the data: %ld\r\n", &paraListPtr->data);
    printf("The address of the actual data: %ld\r\n", &paraListPtr->data[0]);
    printf("The address of the second data: %ld\r\n", &paraListPtr->data[1]);
}//输出顺序列表结构体及其内部成员的内存地址

SequentialListPtr squentialListInit(int paraData[], int paraLength) {
    SequentialListPtr resultPtr = (SequentialListPtr)malloc(sizeof(struct SequentialList));
    for (int i = 0; i < paraLength; i++) {
        resultPtr->data[i] = paraData[i];
    }
    resultPtr->actualLength = paraLength;

    return resultPtr;
}//paraLength表示数组的长度，表示要初始化的数据数量

void sequentialListInsert(SequentialListPtr paraListPtr, int paraPosition, int paraValue) {
    if (paraListPtr->actualLength >= LIST_MAX_LENGTH) {
        printf("Cannot insert element: list full.\r\n");
        return;
    }//检查列表是否已满

    if (paraPosition < 0) {
        printf("Cannot insert element: negative position unsupported.");
        return;
    }//检查插入位置是否合法

    if (paraPosition > paraListPtr->actualLength) {
        printf("Cannot insert element: the position %d is bigger than the list length %d.\r\n", paraPosition, paraListPtr->actualLength);
        return;
    }//检查插入位置是否超出列表当前长度

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

    paraListPtr->data[paraPosition] = paraValue;

    paraListPtr->actualLength++;
}//paraListPtr是指向顺序列表结构体的指针paraPosition指的是插入元素的位置paraValue指插入的元素的值

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

    printf("----sequentialInsert begains.----\r\n");

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

    printf("Now insert to the last, 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(SequentialListPtr paraListPtr, int paraPosition) {
    if (paraPosition < 0) {
        printf("Invalid position: %d.\r\n", paraPosition);
        return -1;
    }

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

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

    paraListPtr->actualLength --;

    return resultValue;
}

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

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

    SequentialListPtr tempList = squentialListInit(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);
}

void clearList(SequentialListPtr paraListPtr) {
    paraListPtr->actualLength = 0;
}

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

 运行结果

 

 代码说明

1.outoutputList函数为顺序表提供了输出功能

2.outputMemory函数输出顺序列表结构体及其内部成员的内存地址

3.sequentialListInit函数初始化SequentialList的结构体，并返回一个指向这个结构体的指针

4.sequentialListInsert函数的目的是在顺序列表的指定位置插入一个元素

5.函数sequentialListDelete的目的是从顺序列表中删除指定位置的元素，并返回被删除元素的值

6.用 typedef struct SequentialList 定义一个新的结构体, 即数据结构的数据部分. 这里使用了指向结构体的指针