王道ch1-Sqlist1.从顺序表中删除具有最小值的元素，空出位置由最后一个元素填补

#include <iostream>
using namespace std;
//任务：从顺序表中删除具有最小值的元素，空出位置由最后一个元素填补
#define Initsize 50
typedef struct {
	int* data;
	int length, maxsize;
}SqList;
//初始化
void Init(SqList& L)
{
	L.data = new int[Initsize];
	for (int i = 0; i < 5; i++)
	{
		cin >> L.data[i];
	}
	L.length = 5;
}
bool delminElem(SqList& L)
{
	int min = L.data[0], j = 0;
	if (L.length == 0)
		return false;
	for (int i = 0; i < L.length; i++)
	{
		if (L.data[i] <= min)
		{
			min = L.data[i];
			j = i;
		}
	}
	L.data[j] = L.data[L.length - 1];
	L.length--;
	return true;
}

int main()
{
	SqList L;
	Init(L);
	delminElem(L);
	for (int i = 0; i < L.length; i++)
		cout << L.data[i]<<" ";
	return 0;
}