typedef struct LNode *List;
struct LNode {
int Date[10];
int Last;
};
//初始化
List MakeEmpty()
{
List PtrL;
PtrL = (List)malloc(sizeof(struct LNode));
PtrL->Last = -1;
return PtrL;
}
//查找
int Find(int a, List PtrL)
{
int i = 0;
while (i <= PtrL->Last && PtrL->Date[i] != a)
i++;
if (i > PtrL->Last) return -1;
else return i;
}
//插入
void Insert(int a, int i, List PtrL)
{
int j;
if (PtrL->Last == MAXSIZE - 1)
{
printf(“表满”);
return;
}
if (i<1 || i>PtrL->Last + 2)
{
printf(“位置不合法”);
return;
}
for (j = PtrL->Last; j >= i - 1; j–)
PtrL->Date[j + 1] = PtrL->Date[j];
PtrL->Date[i - 1] = a;
PtrL->Last++;
return;
}
//删除
void Delete(int i, List PtrL)
{
int j;
if (i<1 || i>PtrL->Last + 1)
{
printf(“不存在第%d个元素”, i);
return;
}
for (j = i; j <= PtrL->Last; j++)
PtrL->Date[j - 1] = PtrL->Date[j];
PtrL->Last–;
return;
}