/*从顺序表中删除其值在给定值s与t之间(包含s和t,要求s<t)的所有元素,
若s或t不合理或顺序表为空,则显示出错信息并退出运行*/
#include<stdio.h>
#include<stdlib.h>
#define InitSize 10
typedef int ElemType;
typedef struct{
ElemType *data;
int length;
}SqList;
bool InitList(SqList &L)
{
L.data = (ElemType*)malloc(sizeof(ElemType)*InitSize);
L.length = 0;
return true;
}
bool deleOrderElem(SqList &L,ElemType s,ElemType t)
{
if(L.length == 0 || s>=t) return false;
int k=0;
for(int i=0;i<L.length;++i)
if(L.data[i]>=s && L.data[i]<=t)
++k;
else
L.data[i-k] = L.data[i];
L.length = L.length - k;
return true;
}
bool printList(SqList L)
{
for(int i=0;i<L.length;++i)
printf("%d ",L.data[i]);
printf("\n");
return true;
}
void main()
{
SqList L;
InitList(L);
int a[5] = {4,2,5,6,7};
for(int i=0;i<5;++i)
{
L.data[i] = a[i];
++L.length;
}
printList(L);
deleOrderElem(L,2,5);
printList(L);
}
11-12
430