知识点:
结构体:
typedef struct SQList
{
int elem[10];
int length;
}SQList,*PSQList;
1.初始化
void InitSqList(PSQList ps)
{
assert(ps != NULL);
if(ps == NULL)
return ;
ps->length = 0;
}
初始化测试:
SQList sq;
InitSqList(&sq);
printf("Hello\n");
2.判满
SQList sq;
InitSqList(&sq);
printf("Hello\n");
3.在ps顺序表的pos下标位置,插入val
bool Insert(PSQList ps,int pos,int val)
{
assert(ps != NULL);
if(ps == NULL)
return false;
if(pos < 0 || pos > ps->length || IsFull(ps))
return false;
for(int i = ps->length;i>pos;i--)
{
ps->elem[i] = ps->elem[i-1];
}
ps->elem[pos] = val;
ps->length ++;
return true;
}
在ps顺序表的pos下标位置,插入val 测试:
SQList sq;
InitSqList(&sq);
for(int i = 0;i<10;i++)
{
Insert(&sq,i,i);
}
Show(&sq);
printf("Hello\n");
4.判断ps顺序表是不是空
bool IsEmpt(PSQList ps)
{
assert(ps != NULL);
if(ps == NULL)
return false;
return ps->length==0;
}
判断ps顺序表是不是空 测试: