数据结构1.顺序表

老师代码

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

#define LIST_MAX_LENGTH 10

/**
 * Linear list of integers. The key is data.
 */
typedef struct SequentialList {
    int actualLength;

    int data[LIST_MAX_LENGTH]; //The maximum length is fixed.
} *SequentialListPtr;

/**
 * Output the list.
 */
void outputList(SequentialListPtr paraList) {
    for (int i = 0; i < paraList->actualLength; i++) {
        printf("%d ", paraList->data[i]);
    }// Of for i
    printf("\r\n");
}// Of outputList

/**
 * Initialize a sequential list. No error checking for this function.
 * @param paraListPtr The pointer to the list. It must be a pointer to change the list.
 * @param paraValues An int array storing all elements.
 */
SequentialListPtr sequentialListInit(int paraData[], int paraLength) {
    SequentialListPtr resultPtr = (SequentialList*)malloc(sizeof(SequentialList));
    for (int i = 0; i < paraLength; i++) {
        resultPtr->data[i] = paraData[i];
    }// Of for i
    resultPtr->actualLength = paraLength;

    return resultPtr;
}//Of sequentialListInit

/**
 * Insert an element into a sequential linear list.
 * @param paraListPtr The pointer to the list. It must be a pointer to change the list.
 * @param paraPosition The position, e.g., 0 stands for inserting at the first position.
 * @param paraValue The value to be inserted.
 */
void sequentialListInsert(SequentialListPtr paraListPtr, int paraPosition, int paraValue) {
    // Step 1. Space check.
    if (paraListPtr->actualLength >= LIST_MAX_LENGTH) {
        printf("Cannot insert element: list full.\r\n");
        return;
    }//Of if

    // Step 2. Position check.
    if (paraPosition > paraListPtr->actualLength) {
        printf("Cannot insert element: the position %d is bigger than the list length %d.\r\n", paraPosition, paraListPtr->actualLength);
        return;
    }//Of if

    // Step 3. Move the remaining part.
    for (int i = paraListPtr->actualLength; i > paraPosition; i--) {
        paraListPtr->data[i] = paraListPtr->data[i - 1];
    }//Of for i

    // Step 4. Insert.
    paraListPtr->data[paraPosition] = paraValue;

    // Update the length.
    paraListPtr->actualLength++;
}// Of sequentialListInsert

/**
 * Test the insert function.
 */
void sequentialInsertTest()
{
    int i;
    int tempArray[5] = { 3, 5, 2, 7, 4 };

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

    // Initialize.
    SequentialListPtr tempList = sequentialListInit(tempArray, 5);
    printf("After initialization, the list is: ");
    outputList(tempList);

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

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

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

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

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

/**
 * Delete an element from a sequential linear list.
 * @param paraListPtr The pointer to the list. It must be a pointer to change the list.
 * @param paraPosition The position, e.g., 0 stands for inserting at the first position.
 * @return The deleted value.
 */
int sequentialListDelete(SequentialListPtr paraListPtr, int paraPosition) {
    // Step 1. Position check.
    if (paraPosition < 0) {
        printf("Invalid position: %d.\r\n", paraPosition);
        return -1;
    }//Of if

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

    // Step 2. Move the remaining part.
    int resultValue = paraListPtr->data[paraPosition];
    for (int i = paraPosition; i < paraListPtr->actualLength; i++) {
        paraListPtr->data[i] = paraListPtr->data[i + 1];
    }//Of for i

    // Step 3. Update the length.
    paraListPtr->actualLength--;

    // Step 4. Return the value.
    return resultValue;
}// Of sequentialListDelete

/**
 * Test the delete function.
 */
void sequentialDeleteTest() {
    int tempArray[5] = { 3, 5, 2, 7, 4 };

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

    // Initialize.
    SequentialListPtr tempList = sequentialListInit(tempArray, 5);
    printf("After initialization, the list is: ");
    outputList(tempList);

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

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

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

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

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

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

}// Of sequentialDeleteTest

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

运行结果：

自己写的函数：

 

#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");
}
//输出数组中各个数据

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

    return resultPtr;
}
//初始化数组

int locateElement(SequentialListPtr paraListPtr, int paraValue) 
{
    for (int i = 0; i < paraListPtr->actualLength; i++) 
    {
        if (paraListPtr->data[i] == paraValue) 
        {
            return i;
        }
    }
    return -1;
}
//定位给出的数字在数组中的位置

int getElement(SequentialListPtr paraListPtr, int paraPosition) {
    if (paraPosition < 0) //检查输入的数字是否小于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;
    }
    return paraListPtr->data[paraPosition-1];
}
//找出所给顺序表位置上的数字

void clearList(SequentialListPtr paraListPtr) 
{
    paraListPtr->actualLength = 0;
}
//清空顺序表

void locateElementTest()
{
    int tempArray[5] = { 3, 5, 2, 7, 4 };
    SequentialListPtr tempList = sequentialListInit(tempArray, sizeof(tempArray)/4);
    printf("---- locateElementTest begins. ----\r\n");
    printf("After initialization, the list is: ");
    outputList(tempList);
    printf("now test 3\n");
    int a=locateElement(tempList,3);
    if (a != -1)
    {
        printf("inuput value rank %d\n",a+1);
    }
    else
    {
        printf("the value you input dosen't exit\n");
    }
    outputList(tempList);
}

void getElementTest()
{
    int tempArray[5] = { 3, 5, 2, 7, 4 };
    SequentialListPtr tempList = sequentialListInit(tempArray, sizeof(tempArray)/4);
    printf("---- getElementTest begins. ----\r\n");
    printf("After initialization, the list is: ");
    outputList(tempList);
    printf("now test 1\n");
    int b=getElement(tempList, 1);
    if (b != -1)
    {
        printf("you get %d from that position\n",b);
    }
    outputList(tempList);
}

void clearListTest()
{
    int tempArray[5] = { 3, 5, 2, 7, 4 };
    SequentialListPtr tempList = sequentialListInit(tempArray, sizeof(tempArray)/4);
    printf("---- clearListTest begins. ----\r\n");
    printf("After initialization, the list is: ");
    outputList(tempList);
    printf("now clear it");
    clearList(tempList);
    outputList(tempList);
    printf("clear sucess");
}

void main()
{
    locateElementTest();
    getElementTest();
    clearListTest();
}

运行结果：