静态顺序表

#include <stdio.h>

#define LIST_INITSIZE 100
#define ElemType int
#define Status int
#define OK 1
#define ERROR 0

typedef struct
{
ElemType elem[LIST_INITSIZE];
int length;
}SqList;

Status InitList_Sq(SqList &L)
{
L.length = 0;
return OK;
}

Status ListInsert(SqList &L, int i,ElemType e)
{
ElemType *p, *q;
int k;
if(i < 1 || i > L.length + 1)
{
printf(“i值不合法！\n”);
return ERROR;
}
if(L.length >= LIST_INITSIZE)
{
printf(“元素已满，不能插入！\n”);
return ERROR;
}
//p = &L.elem[i-1];
//for(q = &L.elem[L.length-1]; q >= p; --q)
// *(q+1) = *q;
//*p = e;
for(k = L.length-1; k >= i-1; --k)
{
L.elem[k+1] = L.elem[k];
}
L.elem[i-1] = e;
++L.length;
return OK;
}

Status ListDelete(SqList &L,int i,ElemType &e)
{
ElemType *p, *q;
int k = 0;
if(i < 1 || i > L.length)
{
printf(“删除位置有误!\n”);
return ERROR;
}
e = L.elem[i-1];
//q = &L.elem[L.length-1];
//for(p = &L.elem[i-1]; p < q; ++p)
// *p = *(p + 1);
for(k = i-1; k < L.length-1; ++k)
{
L.elem[k] = L.elem[k+1];
}

--L.length;
return OK;

}

Status GetElem(SqList L, int i ,ElemType &e)
{
if(i < 1 || i > L.length)
{
printf(“获取元素位置有误!\n”);
return ERROR;
}
e = L.elem[i-1];
return OK;
}

void ListPrint(SqList L)
{
int i;
ElemType e;
for(i = 1; i <= L.length; ++i)
{
if(GetElem(L, i ,e))
printf("%d “,e);
}
printf(”\n");

}

void DisCreat(SqList A,SqList &B,SqList &C)
{
int i;
for(i = 0; i < A.length; ++i)
{
if(A.elem[i] < 0)
ListInsert(B , B.length+1 , A.elem[i]);
else
ListInsert(C , C.length+1 , A.elem[i]);
}
}

int main(void)
{
SqList L;
SqList B, C;
int i;
ElemType e;
ElemType data[9] = {11,-22,33,-3,-88,21,77,0,-9};
InitList_Sq(L);
InitList_Sq(B);
InitList_Sq©;

for (i = 1; i <= 9; i++)
{
	ListInsert(L,i,data[i-1]);
}
printf("插入完成后L = : ");
ListPrint(L);
ListDelete(L,1,e);
printf("删除第1个后L = : ");
ListPrint(L);
DisCreat(L , B, C);
printf("拆分L后B = : ");
ListPrint(B);
printf("拆分L后C = : ");
ListPrint(C);
printf("拆分L后L = : ");
ListPrint(L);

return 0;

}