数据结构:删除顺序表中小于min和大于max的数(不需要从大到小排列依然可以)

1.题目要求:
设计一个算法，删除递增有序链表中值小于min和大于max的所有元素

2.题目分析
依次找到对应元素,而后进行删除.

int listDelete(SqList& L, int min, int max)		 //删除顺序表中小于min,大于max的元素
{
	int n =L.length;

	while (n) {
		for (int i = 1; i <= L.length; i++) {
			if (L.elems[i-1]<min || L.elems[i-1]>max) {
				listDelete1(L, i);
				break;
			}			
		}
		n--;
	}
	return true;
	}

该方法的主要实现函数,可以进行参考(欢迎交流意见)!!!

代码实现::

#include<stdlib.h>
#include <iostream>

#define SUCCESS 1
#define FAILURE 0
#define OVERFLOW 1
#define MAX_SIZE 100

using namespace std;

typedef struct {
	int* elems;
	int length;
	int size;
}SqList;
						  				  				  

void swap(int* num1, int* num2) {
	int temp = *num1;
	*num1 = *num2;
	*num2 = temp;
}

void SelectSort1(int arr[], int len) {    //选择排序
	for (int i = 0; i < len - 1; i++) {
		int max = 0;
		for (int j = 1; j < len - i; j++) {
			if (arr[j] > arr[max]) {
				max = j;
			}
		}
		if (max != (len - i - 1)) {
			swap(&arr[max], &arr[len - i - 1]);
		}
	}
}

bool InitList(SqList& L)		 //顺序表的初始化
{
	L.elems = new int[MAX_SIZE];
	if (!L.elems) return false;
	L.length = 0;
	L.size = MAX_SIZE;
	return true;
}

bool listAppend(SqList& L, int e)		 //顺序表的增加
{
	if (L.length >= L.size) return false;
	L.elems[L.length] = e;
	L.length++;
	return true;
}

bool listDelete1(SqList& L, int i)   //删除第i位置的元素
{
	if (i < 1 || i > L.length) return false;
	if (i == L.length) {
		L.length--;
		return true;
	}
	for (int j = i-1; j < L.length - 1; j++) {
		L.elems[j] = L.elems[j+1];
	}
	L.length--;
	cout << "删除成功" << endl;
	return true;
}

int listDelete(SqList& L, int min, int max)		 //删除顺序表中小于min,大于max的元素
{
	int n =L.length;

	while (n) {
		for (int i = 1; i <= L.length; i++) {
			if (L.elems[i-1]<min || L.elems[i-1]>max) {
				listDelete1(L, i);
				break;
			}			
		}
		n--;
	}
	return true;
	}

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

int main(void) {
	int count, e, min, max;
	SqList L;
	InitList(L);
	cout << "初始化成功" << endl;
	cout << "请输入要添加的元素个数:";
	std::cin >> count;
	for (int i = 0; i < count; i++) {
		cout << "\n请输入要添加的元素e:";
		std::cin >> e;
		if (listAppend(L, e)) {
			cout << "添加成功!" << endl;
		}else {
			cout << "添加失败!" << endl;
		}
	}
	listPrint(L);
	cout << "删除元素" << endl;
	
	cout << "请输入最小元素min和最大元素max:" << endl;
	cin >> min >> max;
	listDelete(L, min, max);

	listPrint(L);
	listPrint(L);
	
	system("pause");
	return 0;
}

运营结果: