[2023 King's Road Data Structure] [Linear Table 06] 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:

>将这个线性表看成两部分
>第一部分是已经无重复部分，第二部分带查找部分
>如果第一部分的尾元素与第二部分首元素不等将其加入到第一部分尾部
>如果不等，则第二部分后移一位继续比较

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 DelValue(SqList &L)
{
    if (L.length == 0)
    {
        return;
    }
    int k = 0;
    for (int i = 1; i < L.length; i++)
    {
        if (L.data[k] != L.data[i])
        {
            L.data[++k] = L.data[i];
        }
    }

    L.length = k + 1;
}

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

    DelValue(L);
    PrintList(L);
}