转专业后,感觉这个数据结构是最吃老本的。。。
写点简单的代码,求各位大神放过,都是小萌新的艰辛泪啊
感觉比较适合像我这样基础差的小萌新
#define LIST_INIT_SIZE 100
#define LISTINCREMENT 10
#define ElemType int
#define OK 1
#define ERROR 0
#define Status int
#define TRUE 1
#define FALSE 0
typedef struct{
ElemType *elem;
int length;
int listsize;
}SqList;
Status InitList_Sq(SqList &L) //初始化线性表
{ //注意传参时的引用符号 SqList &L可以改成SqList *L
//写代码在这个地方漏掉过引用符号
L.elem=(ElemType *)malloc(LIST_INIT_SIZE*sizeof(ElemType));
if(!L.elem)
exit(OVERFLOW); //三要素 L.elem L.length L.listsize
L.length=0;
L.listsize=LIST_INIT_SIZE;
return OK;
}
void DestroyList_Sq(SqList &L) //销毁线性表
{
free(L.elem);
L.elem=NULL;
L.length=0;
L.listsize=0;
}
void ClearList_Sq(SqList &L) //清空线性表
{
L.length=0;
}
Status ListEmpty_Sq(SqList L) //判断线性表是否为空
{
if(L.length==0)
return TRUE;
else
return FALSE;
}
int ListLength_Sq(SqList L) //判断线性表的长度
{
return L.length;
}
Status GetElem_Sq(SqList L,int i,char &e) //获得线性表第i个元素
{
if(i<1||i>L.length)
return ERROR;
else
e=L.elem[i-1];
return OK;
}
int LocateElem_Sq(SqList L,ElemType e,Status(*compare)(ElemType,ElemType)) //在顺序表中寻找元素i并返回元素位置
{
int i=1;
while(i<=L.length&&!(*Compare)(*p++,e))
i++;
if(i<=L.length)
return i;
else
return 0;
}
Status PriorElem_Sq(SqList L,ElemType cur_e,ElemType pre_e) //寻找第一个元素cur_e的前继元素
{
int i=1;
if(L.elem[0]!=cur_e)
{
while(i<L.length&&L.elem[i]!=cur_e)
i++;
if(i<L.length)
{
pre_e=L.elem[i-1];
return OK;
}
}
return ERROR;
}
Status ListInsert_Sq(SqList &L,int i,ElemType e) //顺序表插入
{
ElemType *newbase;
ElemType *p,*q;
if(i<1||i>L.length)
return ERROR;
if(L.length>=L.listsize)
{
newbase=(ElemType *)realloc(L.elem,(L.listsize+LISTINCREMENT)*sizeof(ElemType))
if(!newbase)
exit(OVERFLOW);
L.elem=newbase;
L.listsize += LISTINCREMENT;
}
q=&L.elem[i-1];
for(p=&L.elem[L.length-1];p>=q;p--)
*(p+1)=*p;
*q=e;
L.length++;
return OK;
}
Status ListDelete_Sq(SqList &L,int i, ElemType &e) //顺序表删除
{
char *p,*q;
if(i<1||i>L.length)
return ERROR;
p=&L.elem[i-1];
e=*p;
q=L.elem+L.length-1; //q=&L.elem[L.length-1];
p++;
for(;p<=q;p++)
{
*(p-1)=*p;
}
L.length--;
return OK;
}