C++顺序表的操作

仅为记录学习，写的不好勿喷

#include<iostream>
#define MAXSIZE 100
#define Y 1
#define N 0
using namespace std;
typedef struct SqList {
	int data[MAXSIZE];//存数据
	int length;//存长度
}SqList;
void init(SqList &L) {
	int n;
	cout << "请输入你的初始数组的长度：" << endl;
	cin >> n;
	cout << "请输入你的初始数组,数字用空格隔开，保持增序：" << endl;
	for (int i = 0; i < n; i++) {
		cin >> L.data[i];
	}
	L.length = n;
}
void Display(SqList L) {
	for (int i = 0; i < L.length; i++) {
		cout << L.data[i] << " ";
	}
	cout << endl;
}
//在正确位置添加元素，保证依然保持增序
void Add(SqList& L,int number) {
	for (int i = 0; i < L.length-1; i++) {
		//中间位置
		if (L.data[i]<number && L.data[i + 1]>number) {
			for (int j = L.length; j > i + 1; j--) {
				L.data[j] = L.data[j - 1];
			}
			L.data[i + 1] = number;
			L.length++;
		}
		//末尾
		else if (L.data[L.length - 1] < number && L.length < MAXSIZE - 1) {
			L.data[L.length] = number;
			L.length++;
		}
		//开头
		else if (L.data[0] >= number && L.length < MAXSIZE - 1) {
			for (int j = L.length; j > 0; j--) {
				L.data[j] = L.data[j - 1];
			}
			L.data[0] = number;
			L.length++;
		}
		else if (L.length == 0) {
			L.data[0] = number;
		}
	}
}
//删除元素
void DeleteElem(SqList &L,int target) {
	for (int i = 0; i < L.length; i++) {
		//末尾
		if (L.data[L.length-1] == target) {
			L.data[L.length - 1] = 0;
			L.length--;
		}
		//中间
		else if (L.data[i] == target) {
			for (int j = i; j < L.length - 1; j++) {
				L.data[j] = L.data[j + 1];
			}
			L.length--;
		}
	}
}
//查找
int Locate(SqList L,int target) {
	for (int i = 0; i < L.length; i++) {
		if (L.data[i] == target) {
			return i;
		}
	}
	return -1;
}
int main() {
	SqList L;
	//一定要初始化长度
	L.length = 0;
	int target;
	int n = 0;
	init(L);
	cout << "你想添加几个数字：" << endl;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cout << "请输入你想添加的数字：";
		int num;
		cin >> num;
		Add(L, num);
		cout << "新数组为：" << endl;
		Display(L);
	}
	int del = 0;
	cout << "请输入你想删除几个数字：";
	cin >> del;
	for (int i = 0; i < del; i++) {
		cout << "请输入你想删除的元素:" << endl;
		cin >> target;
		if (Locate(L, target) != -1) {
			DeleteElem(L, target);
		}
		else {
			cout << "删除失败，元素不存在" << endl;
		}
		cout << "新数组为：" << endl;
		Display(L);
	}
	while (true) {
		cout << "请输入你想查找的数字：";
		cin >> target;
		if (Locate(L, target) == -1) {
			cout << "查找失败，不存在" << endl;
		}
		else {
			cout << "index=" << Locate(L, target) << endl;
		};
		cout << "你还想继续查吗：(Y/N)" << endl;
		char a;
		cin >> a;
		if (a == 'Y') { continue; }
		else {
			break;
		}
	}
	return 0;
}