C++序列列表操作实现-优快云博客

本文链接：https://blog.youkuaiyun.com/Perce_Issac/article/details/82596124

#include<iostream>
using namespace std;
#define ok 0;
#define error -1;

class SeqList {
private:
	int *list;
	int maxsize;
	int size;
public:
	SeqList();
	~SeqList();
	void input();
	void output();
	//int list_size();
	int list_insert(int i, int item);
	int list_del(int i);
	int list_get(int i);

};

SeqList::SeqList() {
	maxsize = 1000;
	size = 0;
	list = new int[maxsize];
}

SeqList::~SeqList() {
	delete[]list;
}

void SeqList::input() {
	cin >> size;
	for (int i = 0; i < size; i++) {
		cin >> list[i];
	}
}

void SeqList::output() {
	cout << size;
	for (int i = 0; i < size; i++) {
		cout << " " << list[i];
	}
	cout << endl;
}
int SeqList::list_del(int i) {
	if (i <= 0 || i > size)return error;
		int*q = &list[i - 1];
		int*p = &list[size - 1];
		for (++q; q <= p; ++q)
			*(q - 1) = *q;
		size--;
		output();
		return ok;
}

int SeqList::list_insert(int i, int item) {
	if (i <= 0 || i > size)return error;
		int*q = &list[i - 1];
		int*p = &list[size - 1];
		for (; p >= q; --p)
			*(p + 1) = *p;
		*q = item;
		size++;
		output();
		return ok;
}

int SeqList::list_get(int i) {
	if (i <= 0 || i > size)return error;
		int m = list[i - 1];
		return m;
}

int main() {
	SeqList da;
	da.input();
	da.output();
	int i, item,k;
	cin >> i >> item;
	k=da.list_insert(i, item);
	if (k == -1)cout << "error" << endl;
	cin >> i >> item;
	k=da.list_insert(i, item);
	if (k == -1)cout << "error" << endl;
	cin >> i;
	k=da.list_del(i);
	if (k == -1)cout << "error" << endl;
	cin >> i;
	k=da.list_del(i);
	if (k == -1)cout << "error" << endl;
	cin >> i;
	k= da.list_get(i);
	if (k == -1)cout << "error" << endl;
	else cout << k << endl;
	cin >> i;
	k = da.list_get(i);
	if (k == -1)cout << "error" << endl;
	else cout << k << endl;
	return 0;
}

#include<iostream>

#include<stdlib.h>
using namespace std;
#define ok 0;
#define error -1;

class SeqList {
private:
	int *list;
	int maxsize;
	int size;
public:
	SeqList();
	~SeqList();
	void input();
	void output();
	int list_insert(int i, int item);
	int list_del(int i);
	int list_get(int i);

};

SeqList::SeqList() {
	maxsize = 1000;
	size = 0;
	list = new int[maxsize];
}

SeqList::~SeqList() {
	delete[]list;
}

void SeqList::input() {
	cin >> size;
	for (int i = 0; i < size; i++) {
		cin >> list[i];
	}
}

void SeqList::output() {
	cout << size<<" ";
	for (int i = 0; i < size; i++) {
		cout  << list[i] << " ";
	}
	cout << endl;
}
int SeqList::list_del(int i) {
	if (i <= 0 || i > size)return error;
	int*q = &list[i - 1];
	int*p = &list[size - 1];
	for (++q; q <= p; ++q)
		*(q - 1) = *q;
	size--;
	output();
	return ok;
}

int SeqList::list_insert(int i, int item) {
	if (i <= 0 || i > size+1)return error;
	int*q = &list[i - 1];
	int*p = &list[size - 1];
	for (; p >= q; --p)
		*(p + 1) = *p;
	*q = item;
	size++;
	output();
	return ok;
}

int SeqList::list_get(int i) {
	if (i <= 0 || i > size)return error;
	int m = list[i - 1];
	return m;
}

int main() {
	SeqList da;
	da.input();
	da.output();
	int i, item, k;
	cin >> i >> item;
	k = da.list_insert(i, item);
	if (k == -1)cout << "error" << endl;
	cin >> i >> item;
	k = da.list_insert(i, item);
	if (k == -1)cout << "error" << endl;
	cin >> i;
	k = da.list_del(i);
	if (k == -1)cout << "error" << endl;
	cin >> i;
	k = da.list_del(i);
	if (k == -1)cout << "error" << endl;
	cin >> i;
	k = da.list_get(i);
	if (k == -1)cout << "error" << endl;
	else cout << k << endl;
	cin >> i;
	k = da.list_get(i);
	if (k == -1)cout << "error" << endl;
	else cout << k << endl;

	system("pause");
	return 0;
}

55