顺序表增加元素

顺序表增加元素: 从基地址开始,往后逐个增加

main.cpp

#include <iostream>
#include <graphics.h>
#include <Windows.h>

using namespace std;

#define MAX_SIZE 5

//定义一个顺序表
typedef struct {
	int *elems;		//顺序表的基地址
	int length;		//顺序表的长度
	int size;		//顺序表总空间大小
} Sqlist;

//初始化顺序表
bool initList(Sqlist &list) {
	list.elems = new int[MAX_SIZE];
	if (!list.elems) { return false; }	//分配内存失败
	list.length = 0;					//长度初始化为0
	list.size = MAX_SIZE;				//空间初始化为MAX_SIZE
	return true;
}

//顺序表增加元素
bool listAdd(Sqlist &list, int n) {
	if (list.length == MAX_SIZE) { return false; }	//存储空间已满
	list.elems[list.length] = n;	//传进来的n赋值给elems[length];
	list.length++;					//表的长度加1
	return true;
}

//打印输出顺序表
void ListPrint(Sqlist &list) {
	cout << "顺序表的元素" << endl;
	for (int i = 0; i <= list.length - 1; i++) {
		cout << list.elems[i] << " ";
	}
	cout << endl;
	cout << "顺序表储存空间:" << list.size << "   已保存" << list.length << "个元素" << endl;
}

int main(void) {
	Sqlist list;
	cout << "顺序表初始化" << endl;
	//1.初始化
	if (initList(list)) {
		cout << "顺序表初始化成功!" << endl;
	}

	//2.添加元素
	int count = 0;	//要添加元素的个数
	int e = 0;		//要添加的元素
	cout << "请输入元素个数:";
	cin >> count;

	for (int i = 0; i < count; i++) {
		cout << "请输入要添加的元素:";
		cin >> e;
		if (listAdd(list, e)) {
			cout << "添加成功!" << endl;
		} else {
			cout << "添加失败!" << endl;
		}
	}

	ListPrint(list);

	//删除分配的内存
	delete[] list.elems;
	system("pause");
	return 0;
}