顺序表实现增删插改（进化版）

写两个.cpp文件，一个用于写主函数，一个用来写调用的函数

Sqlist用来写主函数：

Sqlist:

#include <bits/stdc++.h>
using namespace std;
#include "List.cpp"
int main()
{
  SqList list;
  InList(list);//先进行初始化，再执行菜单里面内容
  int select;//定义菜单筛选值
 
  while (1)
  { 
    menu();
    cout << "请输入菜单号:";
    cin >> select;
    switch (select)
    {
    case 1:
      Create(list);
      break;
    case 2:
      isNull(list);
      Insert(list);
      OutList(list);
      break;
    case 3:
     isNull(list);
      DeleList(list);
      OutList(list);
      break;
      case 4:
       isNull(list);
      Location(list);
    case 0:
  DestroyList(list);
      exit(0);
    default:
      cout << "请输入有效值";
    }
  }
  return 0;
}

调用函数的部分:

List:

#include <bits/stdc++.h>
using namespace std;
#define Max_Size 100
typedef int Element;
typedef struct
{
    Element data[Max_Size];
    int length;

} SqList;

//菜单栏
void menu()
{
    cout << "\n******** 1.创建表";
    cout << "******** 2.插入数据";
    cout << "******** 3.删除数据";
    cout << "******** 4.查找数据";
    cout << "******** 0.退出";
    cout << "\n";
}

//初始化顺序表
void InList(SqList &L)
{
    L.length = 0;
}

//输出表中元素
int OutList(SqList L)
{

    for (int i = 0; i < L.length; i++)
    {
        cout << L.data[i] << " ";
    }
    cout << endl;
}

//建立顺序表，添加值
void Create(SqList &L)
{
    cout << "请输入您要输入的元素的个数: " << endl;
    int n;

    cin >> n;
    L.length = n;
    cout << "输入元素:" << endl;
    for (int i = 0; i < n; i++)
        cin >> L.data[i];
    cout << "现在表的长度为"
         << "\n"
         << L.length << "\n"
         << "表格创建完成！" << endl;
}

//插入
void Insert(SqList &L)
{
    int i, n, p;
    cout << "请输入要插入的元素" << endl;
    cin >> p;
    cout << "请输入要插入的位置" << endl;
    cin >> n;

    if (n < 0 || n > L.length + 1)
        cout << "您输入的值是个无效值，请重新输入" << endl;
    else
    {
        cout << "您现在把" << p << "插入到了" << n << "的位置,现在的顺序表为：" << endl;
        for (i = L.length - 1; i >= n - 1; --i)

            L.data[i + 1] = L.data[i];
        L.data[n - 1] = p;
        L.length += 1;
        cout << "长度为:" << L.length << endl;
    }
}

//销毁顺序表
void DestroyList(SqList &L) {}

//删除元素

void DeleList(SqList &L)
{
    int i, k, n;
    cout << "请输入要删除第几个元素:" << endl;
    cin >> n;
    if (n < 1 || n > L.length)
    {
        cout << "请输入有效值!" << endl;
    }
    else
    {

        k = L.data[n - 1]; //查询删除的元素是谁
        cout << "您把表中第" << n << "个元素删除，该元素为" << k << endl
             << "现在的顺序表为" << endl;

        for (i = n; i < L.length; i++)

            L.data[i - 1] = L.data[i];
        L.length -= 1;
    }
}

//查找数据
void Location(SqList &L)
{
    int n, i = 0;
    cout << "请输入您要查找的元素" << endl;
    cin >> n;

    while (i < L.length && L.data[i] != n)
        i++;
    if (i >= L.length)
        cout << "未查到值，或者您输入的值无效";
    else
    {
        cout << "已找到，数组下标为:" << i << endl;
    }
}

//空表判断,解决还未创建表就进行增删改查的问题
void isNull(SqList &L)
{

    if (L.length == 0)
    {
        cout << "请先创建表，才能执行本操作";
        exit(0);
    }
}

效果图:

1.写个isNull函数用来判断是否已经创建了表，如果创建了才可以执行

2.