请教：下面的算法错在哪里？
typedef int ElemTpye;
typedef struct{
ElemTpye *elem;
int length;
int listsize;
}SpList;
Status InitList_Sq(SqList &L){
L.elem=(ElemType*)malloc(LIST_SIZE*sizeof(ElemType));
L.length=0;
L.listsize=LIST_INIT.SIZE;
return OK;}
main（）{
InitList_Sq(SqList A);
InitList_Sq(SqList B);
}
2006-04-15 19:43
请教：下面的算法错在哪里？
typedef int ElemTpye;
typedef struct{
ElemTpye *elem;
int length;
int listsize;
}SpList;
Status InitList_Sq(SqList &L){
L.elem=(ElemType*)malloc(LIST_SIZE*sizeof(ElemType));
L.length=0;
L.listsize=LIST_INIT.SIZE;
return OK;}
main（）{
InitList_Sq(SqList A);
InitList_Sq(SqList B);
}
好像没错啊,是不是绿色的那句红的地方出了问题?
好像应该是L.listsize=LIST_INIT_SIZE;
2006-04-15 22:31
2006-04-16 11:20
请教：下面的算法错在哪里？
typedef int ElemTpye;
typedef struct{
ElemTpye *elem;
int length;
int listsize;
}SpList;
Status InitList_Sq(SqList &L){/*这你用status我感觉应该用int*/
L.elem=(ElemType*)malloc(LIST_SIZE*sizeof(ElemType));
L.length=0;
L.listsize=LIST_INIT.SIZE;
return OK;}/*你没有定义OK是什么加上#define OK 1*/
main（）{
InitList_Sq(SqList A);
InitList_Sq(SqList B);
}
2006-04-18 13:29
2006-04-18 17:03
2021-01-14 22:58
