25考研王道数据结构综合题——第二章顺序表

顺序表6~8

2.2.3.06

#define  _CRT_SECURE_NO_WARNINGS
#include<iostream>
using namespace std;
//线性表的顺序表示

#define Mixsize 50
struct Sqlist {
	int a[Mixsize];
	int length;
};

//综合6
bool unite(Sqlist L,Sqlist Q,Sqlist& S) {

	int i = 0, j = 0, k = 0;
	if (S.length < L.length + Q.length)
		return false;
	while (i < L.length && j < Q.length) {
		if (L.a[i] < Q.a[j]) {
			S.a[k++] = L.a[i++];
		}
		else {
			S.a[k++] = Q.a[j++];
		}
	}
	while (i < L.length) {
		S.a[k++] = L.a[i++];
	}
	while (j < Q.length) {
		S.a[k++] = Q.a[j++];
	}

	return true;
}
int main() {
	Sqlist L;
	
	Sqlist Q;
	
	Sqlist S;
	int i = 0;
	int m;
	cout << "输入第一个表长度" << endl;
	cin >> m;
	L.length = m;
	cout << "输入第一个表的数据" << endl;
	while (i<L.length) {
		cin >> L.a[i];
		i++;
	}
	int j = 0;
	int n;
	cout << "输入第二个表长度" << endl;
	cin >> n;
	Q.length = n;
	cout << "输入第二个表的数据" << endl;
	while (j<Q.length) {
		cin >> Q.a[j];
		j++;
	}
	int l;
	cout << "输入第三个表长度" << endl;
	cin >> l;
	S.length = l;
	unite(L,Q,S);
	cout << "合并后的顺序表为" << endl;
	for (int k = 0; k < m+n; k++) {
		cout << S.a[k] << " ";
	}
	return 0;
}

2.2.3.07

#define  _CRT_SECURE_NO_WARNINGS
#include<iostream>
using namespace std;
//线性表的顺序表示


//综合7,思想:(1,2,3,4)先全部逆置(4,3,2,1)，再对前n个逆置(3,4,2,1)，再对后m个逆置(3,4,1,2)

void reverse(int *A,int left ,int right) {
	int mid = (left + right) / 2;
	for (int i = left; i <= mid; i++) {
		int temp = A[i];
		A[i] = A[right + left - i];
		A[right + left - i] = temp;
	}
}

int main() {
	int m ;
	cout << "m的值" << endl;
	cin >> m;
	int n;
	cout << "n的值" << endl;
	cin >> n;
	int* A = new int[m + n];
	
	int i = 0;
	cout << "数据" << endl;
	while (i < m+n) {
		cin >> A[i];
		i++;
	}
	reverse(A, 0, m+n-1);
	reverse(A, 0, n-1);
	reverse(A, n, m+n-1);
	for (int i = 0; i < m+n; i++) {
		cout << A[i] << " ";
	}
	delete[] A;

	return 0;
}

2.2.3.08

#define  _CRT_SECURE_NO_WARNINGS
#include<iostream>
using namespace std;
//线性表的顺序表示

#define Mixsize 50
struct Sqlist {
	int a[Mixsize];
	int length;
};

//综合8,折半思想

void find(Sqlist& L, int e) {
	int left = 0, right = L.length - 1;
	int mid;
	while (left <= right) {
		mid = (right + left) / 2;
		if (L.a[mid] == e) {
			break;
		}
		else if (L.a[mid] > e) {
			right = mid - 1;
		}
		else {
			left = mid + 1;
		}
	}
	if (L.a[mid] == e && mid != L.length - 1) {
		int temp = L.a[mid];
		L.a[mid] = L.a[mid + 1];
		L.a[mid + 1] = temp;
	}
	if (right < left) {//未找到
		L.length = L.length +1;
		int i;
		for (i = L.length - 2; i > right; i--) {
			L.a[i + 1] = L.a[i];//后移
		}
		L.a[i + 1] = e;//插入，L.a[i]<e，所以插在i+1
	}
}

int main() {
	Sqlist L;
	int m = 0;
	cout << "顺序表长度" << endl;
	cin >> m;
	L.length = m;
	cout << "输入数据" << endl;
	for (int i = 0; i < L.length; i++) {
		cin >> L.a[i];
	}
	int e;
	cout << "输入查找值" << endl;
	cin >> e;
	find(L, e);
	cout << "结果为：" << endl;
	for (int i = 0; i < L.length; i++) {
		cout << L.a[i] << " ";
	}
	return 0;
}