有序表合并，删除给定值区间，删除重复值

王道数据结构代码实现

//删除数组中处于x,y中间的数,包含x, y ，x<y

#include<iostream>
using namespace std;

bool del_st(int *a, int &n,int x, int y){
	int i, k = 0;
	if (x >= y || n == 0) return false;
	for (i = 0; i < n; i++){
		if (a[i] >= x&&a[i] <= y)
			k++;
		else
			a[i - k] = a[i];
	}
	n = n - k;
	return true;
}

从有序顺序表删除值重复的元素

bool del_ss(int *c,int &n){
	if (n == 0) return false;
	int i, k = 0;
	for (i = 0; i < n; i++){
		if (c[i-1]== c[i]){
			k++;
		}
		else{
			c[i - k] = c[i];
		}
	}
	n = n - k;
	return true;
}


//两个有序顺序表合并成一个新的有序顺序表
bool add_ab(int *a, int &a1, int *b, int &b1, int *c, int &c1){
	if (a1 + b1 > c1) return false;
	int i = 0, j = 0, k = 0;
	while (i < a1&&j < b1){
		if (a[i] <= b[j]){
			c[k++] = a[i++];
		}
		else{
			c[k++] = b[j++];
		}
	}
	while (i < a1){

		c[k++] = a[i++];
	}
	while (j < b1){
		c[k++] = b[j++];
	}
	c1 = k;
	return true;
}

int main(){
	int a[5] = { 1, 3, 5, 7, 9 };
	int b[3] = { 2, 4, 6};
	int c[10] = { 1, 3, 3, 3, 5, 5, 6, 7, 8, 8 };
	int a1 = sizeof(a) / sizeof(a[0]);
	int b1 = sizeof(b) / sizeof(b[0]);
	int c1 = sizeof(c) / sizeof(c[0]);

	//--调用del_st---p18 005
	//del_st(a, a1, 3, 5);
	//for (int i = 0; i < a1; i++){
	//	cout << a[i] << " ";
	//}
	//----------------------

	//--调用del_ss --p18 006
	//del_ss(c, c1);
	//for (int i = 0; i < c1; i++){
	//	cout << c[i] << " ";
	//}
	//--------------------

	//--调用add_ab --p18 007
	//add_ab(a, a1, b, b1, c, c1);
	//for (int i = 0; i < c1; i++){
	//	cout << c[i] << " ";
	//}

	return 0;
}