从顺序表中删除其值在给定s与t之间（包含s和t，要求s＜t）的所有元素，若s或t不合理或顺序表为空，则显示出错信息并推出运行

#include <stdio.h>
#define MaxSize 50
struct SqList {
	int a[MaxSize]{ 2,6,9,7,5,1,2,4,3,6};
	int length = 10;
};

void PrintList(SqList L) {
	for (int i = 0; i < L.length;i++) {
		printf("%d", L.a[i]);
			}
	printf("\n");
	printf("表长为%d\,", L.length);
	printf("\n");

}

bool DeleteList(SqList &L,int s,int t) {
	if (L.length == 0||s>=t) {
		printf("表空或不合理。");
		return false;
	}
	int k = 0;
	int i = 0;
	for (; i <L.length; i++) {
		if (L.a[i] >=s && L.a[i] <=t) {
			k++;
		}
		else {
			L.a[i - k] = L.a[i];
		}
	}
	L.length -= k;
	return true;
}


int main(){
	SqList L;
	PrintList(L);
	DeleteList(L, 3, 5);
	PrintList(L);
	return 0;
}