数据结构——顺序表

代码如下：

#include <stdio.h>
#include <malloc.h>
#define LIST_MAX_LENGTH 100

typedef struct SequentialList
{
    int actualLength;
    int data[LIST_MAX_LENGTH];
}*SequentailListPtr;
void outputList(SequentailListPtr paraList)
{
    int i;
    for (i = 0; i < paraList->actualLength; i++)
    {
        printf("%d ", paraList->data[i]);
    }
    printf("\n");
}
void outputMemory(SequentailListPtr 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 first data :%ld\r\n", &paraListPtr->data[0]);
    printf("The address of the second data :%ld\r\n", &paraListPtr->data[1]);
}
SequentailListPtr SequentailListInit(int paraData[], int paraLength)
{
    SequentailListPtr resultPtr = (SequentailListPtr)malloc(sizeof(struct SequentialList));
    int i;
    for (i = 0; i < paraLength; i++)
    {
        resultPtr->data[i] = paraData[i];
    }
    resultPtr->actualLength = paraLength;
    return resultPtr;
}
void sequentailListInsert(SequentailListPtr 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;
    }
    int i;
    for (i = paraListPtr->actualLength; i > paraPosition; i--)
    {
        paraListPtr->data[i] = paraListPtr->data[i - 1];
    }
    paraListPtr->data[paraPosition] = paraValue;
    paraListPtr->actualLength++;
}
void sequentailInsertTest()
{
    int i;
    int tempArray[5] = { 3,5,2,7,4 };
    printf("---- sequentialInsertTest begins. ----\r\n");
    SequentailListPtr tempList = SequentailListInit(tempArray, 5);
    printf("After initialization, the list is: ");
    outputList(tempList);

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

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

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


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

    printf("---- sequentialInsertTest ends. ----\r\n");
}
int sequentailListDelete(SequentailListPtr 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];
    int i;
    for (i = paraPosition; i < paraListPtr->actualLength; i++) {
        paraListPtr->data[i] = paraListPtr->data[i + 1];
    }
    paraListPtr->actualLength--;
    return resultValue;
}
void sequentailDeleteTest() {
    int tempArray[5] = { 3, 5, 2, 7, 4 };
    printf("---- sequentialDeleteTest begins. ----\r\n");
    SequentailListPtr tempList = SequentailListInit(tempArray, 5);

    printf("After initialization, the list is: ");
    outputList(tempList);

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

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

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

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

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

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

    outputMemory(tempList);

}
int locateElement(SequentailListPtr paraListPtr, int paraValue)
{
    int i;
    for (i = 0; i < paraListPtr->actualLength; i++)
    {
        if (paraListPtr->data[i] == paraValue)
        {
            return i;
        }
    }
    return -1;
}
int getElement(SequentailListPtr paraListPtr, int paraPosition)
{
    if (paraPosition < 0)
    {
        printf("Invalid position: %d.\r\n", paraPosition);
        return -1;
    }
    if (paraPosition > paraListPtr->actualLength)
    {
        printf("Cannot get element: the position %d is beyond the list length %d.\r\n", paraPosition, paraListPtr->actualLength);
        return -1;
    }
    return paraListPtr->data[paraPosition];
}
void clearList(SequentailListPtr  paraListPtr)
{
    paraListPtr->actualLength = 0;
}
int main() {
    sequentailInsertTest();
    sequentailDeleteTest();
    return 0;
}

运行结果如图：

心得体会：

顺序表基于数组实现，存储和访问元素高效，但插入和删除操作相对繁琐。它的大小固定，需预分配空间，需根据实际需求权衡空间与性能。