[个人数据结构学习]顺序表-动态分配

初始定义：

typedef struct {
	ElemType* elem;//int类型的数据
	int length;//当前长度
	int listsize;//表长
}SqList;//定义顺序表类`
int InitList(SqList &L) {
	L.elem = (ElemType*)malloc(LIST_INIT_SIZE * sizeof(ElemType));
	if (!L.elem)return 0;
	L.length = 0;
	L.listsize = LIST_INIT_SIZE;
	return 1;
};//初始化顺序表

---

数据进入：

int ListInsert(SqList& L, int i, ElemType e) {
	if (i<1 || i>L.length + 1)return 0;
	if (L.length >= L.listsize)return 0;
	for (int j = L.length; j >= i; j--)
	{
		L.elem[j] = L.elem[j - 1];
	};
	L.elem[i - 1] = e;
	L.length++;
	return 1;
}//插入数

int SetList(SqList &L) {
	int size = 0;
	cout << "请输入你要插入的数据的数量" << endl;
	cin >> size;
	if (size == 0) return 0;
	for (int g=0; g <size;g++) {
		int h;
		cout << "请输入数据" << endl;
		cin >> h;
		L.elem[g] = h;
		L.length++;
	}
	cout << "插入完毕" << endl;
	return 1;
}// 设置顺序表

---

数据弹出：

int DeltList(SqList& L, int i, ElemType &e) {
	if (i<1||i >= L.length) return 0;
	e =L.elem[i - 1];
	for (int j = i; j < L.length ; j++) {
		L.elem[j - 1] = L.elem[j];
	}
	L.length--;
	return 1;
};//删除顺序表

int GetElem(SqList L, int i) {
	if (i < 1 || i >= L.length)return 0; 
	return L.elem[i - 1];
}//按位查找元素

int LocateElem(SqList L, ElemType e) {
	for (int i = 0; i < L.length; i++ ) {
		if (L.elem[i] == e) return i + 1;
	}
	return 0;
}//按值查找

void ShowList(SqList L) {
	for (int i = 0; i < L.length; i++) {
		cout << L.elem[i] << endl;
	}
}//展示顺序表

---

运行代码：

int main() {
	SqList L1;
	InitList(L1);
	SetList(L1);
	ShowList(L1);
	//cout << "间隔" << endl;
	//ListInsert(L1, 2, 231);
	//ListInsert(L1, 4, 999);
	//ShowList(L1);
	//cout << "间隔" << endl;
	//int e = -1;
	//DeltList(L1, 2, e);
	//ShowList(L1);
	//cout << "e的值是" << e << endl;
	int p = 10;
	cout << LocateElem(L1, p) << endl;
	system("pause");
	return 0;
}