顺序表的插入和删除

#include <iostream>
using namespace std;

#define MAX 101
struct List
{
	int element[MAX];
	int last;
};

void init(struct List &L)
{
	L.last = 0;
	while (1)
	{
		int e;
		cin >> e;
		if (e == 0)	//如果输入0就结束输入
			break;
		L.last++;
		L.element[L.last] = e;
	}
}

void print(struct List L)
{
	for (int i = 1; i <= L.last; i++)
		cout << L.element[i] << " ";
	cout << endl;
}

void insert(struct List &L, int p)
{
	if (p<1 || p>L.last || L.last == MAX - 1)
	{
		cout << "插入失败" << endl;
		return;
	}
	for (int i = L.last; i >= p; i--)
	{
		L.element[i + 1] = L.element[i];
	}
	int x;
	cout << "请输入要插入的数字:";
	cin >> x;
	L.element[p] = x;
	L.last++;
	
}

void delate(struct List &L, int p)
{
	if (p<1 || p>L.last)
	{
		cout << "删除失败" << endl;
		return;
	}
	for (int i = p; i <= L.last; i++)
	{
		L.element[i] = L.element[i + 1];
	}
	L.last--;
}

int main()
{
	struct List L;

	init(L);
	print(L);
	insert(L, 4);
	print(L);
	insert(L, 0);
	print(L);
	delate(L, 4);
	print(L);
	delate(L, 0);
	print(L);
	delate(L, 100);
	print(L);


	return 0;
}