王道ch1-线性表的定义，插入，删除，按值查找

#include <iostream>
using namespace std;
//任务：定义，静态and动态，第i个位置插入元素e，删除第i个元素，按值查找e
//静态
/*
#define Maxsize 50
typedef struct {
	int data[Maxsize];
	int length;
}SqList;
*/
#define Initsize 50
typedef struct {
	int* data;
	int length, maxsize;
}SqList;
//初始化
void Init(SqList& L)
{
	L.data = new int[Initsize];
	for (int i = 0; i < 5; i++)
	{
		cin >> L.data[i];
	}
	L.length = 5;
}
//插入
bool Insert(SqList& L, int i, int e) {
	if (i<1 || i>L.length+1)
		return false;
	if (L.length >= Initsize)
		return false;
	for (int j = L.length; j >= i; j--)
		L.data[j] = L.data[j - 1];
	L.data[i - 1] = e;
	L.length++;
	return true;
}
//删除
bool Delete(SqList& L, int i)
{
	if (i<1 || i>L.length)
		return false;
	int e = L.data[i-1];
	for (int j = i; j < L.length; j++)
		L.data[j - 1] = L.data[j];
	L.length--;
	return true;
	
}
//按值查找
int getElem(SqList& L, int e)
{
	int i=0;
	while (i<L.length)
	{
		if (L.data[i] == e)
          return i+1;
		i++;
	}
}
int main()
{
	SqList L;
	Init(L);
	//Insert(L,5,5);
	//Delete(L, 2);
	//getElem(L, 3);
	cout<< getElem(L, 3)<<endl;
	for (int i = 0; i < L.length; i++)
		cout << L.data[i]<<" ";
	return 0;
}