该楼层疑似违规已被系统折叠 隐藏此楼查看此楼
#include
#include
#include
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2
typedef int Status;
#define LIST_INIT_SIZE 100//线性表存储空间的初始分配值
#define LISTINCREMENT 10//线性表存储空间的分配增量
typedef int ElemType;
typedef struct
{
ElemType *elem;
int length;
int listsize;
}SqList;
Status InitList_Sq(SqList &L) {//构造一个空的线性表L
L.elem = (ElemType *) malloc(LIST_INIT_SIZE * sizeof(ElemType));
if (!L.elem) {
exit(OVERFLOW);//存储分配失败
}
L.length = 0;//空表长度为0
L.listsize = LIST_INIT_SIZE;//初始存储容量
return OK;
}
int main()
{
SqList L,newL;
int x,y,i;
scanf("%d",&L.length);
L.elem=(int*)malloc(sizeof(int)*L.length);
if(L.elem==NULL)
return OVERFLOW;
for(i=0;i
scanf("%d",&L.elem[i]);
scanf("%d%d",&x,&y);
int p=0;
newL.elem=(int*)malloc(sizeof(int)*L.length);
newL.length=0;
for(i=0;i
{
if(L.elem[i]y)
{
newL.elem[p++]=L.elem[i];
newL.length++;
}
}
for(i=0;i
printf("%d ",newL.elem[i]);
printf("%d\n",newL.elem[newL.length-1]);
}