西农大 数据结构 习题

题目描述
在顺序存储结构实现基本操作:初始化、创建、插入、删除、查找、遍历、逆置、合并运算。
输入描述:
请输入线性表 La 的长度: n 
 al a2a3.. an (数值有序,为降序)
请输入要插入到线性表 La 中的数字×和插入的位置 i : x i 请输入要删除数字的位置: i 
请输入要查找的数字: x 请输入线性表长度: m 
b1b2... bom (数值有序,为升序)
输出描述:
插入一个数字后的线性表 al a2... an +1删除一个数字后的线性表 al a2... an 
查找一个输入的数字后如果找到,输出该数字的位置 i ,如果没有找到,输出" Not found "的信息。
逆置 a a2... an 后的线性表 an an —1...a1合并两个线性表后的线性表

#include <iostream>
using namespace std;
#include <algorithm>

//template <class T>
class SeqList {
private:
	int length;
public:
	int* data;
	SeqList() {};
	SeqList(int n) {
		length = n;
		data = new int[length];
		for (int i = 0; i < length; i++) {
			cin >> data[i];
		}
	}

	bool Insert(int x, int i) { // 插入元素
		if (i < 0 || i >= length) return false;
		int * data1 = new int [length];
		for (int j = 0; j < length; j++) {
			data1[j] = data[j];
		}
		int* data2 = data;
		data = new int[length + 1];
		for (int i = 0; i < length; i++) {
			data[i] = data1[i];
		}
		delete[] data2;
		delete[] data1;
		for (int j = length - 1; j >= i-1; j--) {
			data[j + 1] = data[j];
		}
		data[i-1] = x;
		length++;
		return true;
	}

	bool Remove(int i) {
		if (i < 0 || i >= length) return false;
		for (int j = i-1; j < length; j++) {
			data[j] = data[j + 1];
		}
		length--;
		return true;
	}

	int Search(int x) {
		int i = 0;
		for (i = 0; i < length; i++) {
			if (data[i] == x) {
				cout << i+1 << endl;
				return 1;
			}
		}
		cout << "Not found" << endl;
		return -1;
	}

	void NiZhi() {
		int temp = 0;
		for (int i = 0; i <= (length-1)/2; i++) {
			temp = data[i];
			data[i] = data[length - 1 - i];
			data[length - 1 - i] = temp;
		}
	}

	void HeBing(SeqList B) {
		int* data1 = new int[length + B.length];
		for (int j = 0; j < length; j++) {
			data1[j] = data[j];
		}
		delete[] data;
		data = data1;
		for (int i = length; i < length + B.length; i++) {
			data[i] = B.data[i - length];
		}
		length = length + B.length;
	}

	void Print1() {
		for (int i = 0; i < length; i++) {
			cout << data[i] << " ";
		}
		cout << endl;
	}

	void Print2() {
		sort(data,data+length-1);
		for (int i = 0; i < length; i++) {
			cout << data[i] << " ";
		}
		cout << endl;
	}
};


int main() {
	int n1, n2;
	cin >> n1;
	SeqList L1 = SeqList(n1);
	cin >> n1 >> n2;
	L1.Insert(n1, n2);
	L1.Print1();
	cin >> n1;
	L1.Remove(n1);
	L1.Print1();
	cin >> n1;
	L1.Search(n1);
	L1.NiZhi();
	L1.Print1();
	cin >> n1;
	SeqList L2 = SeqList(n1);
	L1.HeBing(L2);
	L1.Print2();
 }