【数据结构C++】删除顺序表的最小值

代码如下

#include<iostream>
using namespace std;
#define Max 50      //定义全局变量不需要等号和分号
struct Sqlist {
	int a[Max] = { 2,3,6,9,7,6,1,8,10 };
	int length = 9;
};
bool ListDel(Sqlist& s, int& a) {
	if (s.length == 0)return false;
	int min = s.a[0];
	int index = 0;
	for (int i = 0; i < s.length; i++) {
		if (s.a[i] <= min) {
			min = s.a[i]; index = i;
		}
	}
	a = min;
	//由于这里没说删除后后面的元素依次替补，
	//因此为了减少时间复杂度可以将最后一个元素替补过去
	s.a[index] = s.a[s.length - 1];
	s.length--;
	return true;
}
int main() {
	Sqlist s;
	int ele = -1;
	if (s.length > 0) {
		cout << "删除前：" << endl;
		for (int i = 0; i < s.length; i++) {
			cout << s.a[i]<<"  ";
		}
		cout << endl;
		ListDel(s, ele);
		cout << "删除后：" << endl;
		for (int j = 0; j < s.length; j++) {
			cout << s.a[j]<<"  ";
		}
		cout << endl;
	}
	else cout << "错误！" << endl;
}

 参考：王道考研视频