[2023 King's Road Data Structure] [Linear Table 02] Complete implementation of C and C++ (can be run directly)

~~~How can the writing style end in a dull way, and the story does not recognize ordinary at the beginning ✌✌✌

If you need the complete code, you can follow the public account below, and reply "code" in the background to get it. Aguang is looking forward to your visit~

topic:

Problem solving ideas:

>由于题目要求算法的空间复杂度为O(1)，所以肯定是不能开辟新的数据进行复制的
>所以这里定义个临时变量，用于保存当前值
>不断交换首尾对应位置的元素
>由于首尾对称，所以只需要循环表长的一半

Code:

#include <iostream>
using namespace std;
#define Maxsize 50

// 定义顺序表结构
typedef struct
{
    int data[Maxsize];
    int length = 0;
} SqList;

// 插入测试数据
void ListInsert(SqList &L)
{
    int val = 0;
    while (cin >> val)
    {
        L.data[L.length++] = val;

        if (cin.get() == '\n')
        {
            break;
        }
    }
}

// 打印顺序表
void PrintList(SqList L)
{
    for (int i = 0; i < L.length; i++)
    {
        cout << L.data[i] << '\t';
    }
    cout << endl;
}

// 题目功能函数
void ReverseList(SqList &L)
{
    int temp = 0;
    for (int i = 0; i < L.length / 2; i++)
    {
        temp = L.data[i]; // 定义临时变量保存当前位置的值
        // 将首尾对应位置进行交换
        L.data[i] = L.data[L.length - i - 1];
        L.data[L.length - i - 1] = temp;
    }
}

int main()
{
    SqList L;      // 创建一个顺序表
    ListInsert(L); // 插入写测试数据
    PrintList(L);

    ReverseList(L);
    PrintList(L);
}