Question

数据结构线性表问题

请各位高手帮我看一下，代码是照着课本打的，可是用VC编译时总是有错（旁边加注释的都是我照着课本打出来的）,可以的话麻烦加我QQ，我还有一些细节想问一下。

#include<stdio.h>
#include<malloc.h>
#define OK 1
#define ERROR 0
#define LIST_INIT_SIZE 100
#define LISTINCREMENT 10
#define ElemType int

typedef struct
{
int *elem;
int length;
int listsize;
}SqList;

int InitList_Sq(SqList &L)
{
L.elem=(ElemType * )malloc(LIST_INIT_SIZE*sizeof(ElemType));
if(!L.elem) exit(ERROR);
L.length=0;
L.listsize=LIST_INIT_SIZE;
return OK;
}

int Load_Sq(SqList &L)
{

int i;
if(L.length==0) printf("The List is empty!"); // 请填空
else
{
printf("The List is: ");
for(i=0;i<L.length;i++,L.elem++) printf("%d ",L.elem); // 请填空
}
printf("\n");
return OK;
}

int ListInsert_Sq(SqList &L,int i,int e) //在第i个位置之前插入新的元素e
{
int *newbase,*q;
if(i<1||i>L.length+1) 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;
}

int ListDelete_Sq(SqList &L,int i, int &e) //删除第i个元素，并用e返回其值
{
int *q;
if((i<1)||(i>L.length)) return ERROR;
p=&(L.elem[i-1]);
e=*p;
q=L.elem+L.length-1;
for(++p;p<=q;++p) *(p-1)=*p;
--L.length;
return OK;
}

int main()
{
SqList T;
int a, i;
ElemType e, x;
if(InitList_Sq(T)==OK) // 判断顺序表是否创建成功
{
printf("A Sequence List Has Created.\n");
}
while(1)
{
printf("1:Insert element\n2:Delete element\n3:Load all elements\n0:Exit\nPlease choose:\n");
scanf("%d",&a);
switch(a)
{
case 1: scanf("%d%d",&i,&x);
if(ListInsert_Sq(T,i,e)!=OK) printf("Insert Error!\n"); // 判断i值是否合法，请填空
else printf("The Element %d is Successfully Inserted!\n", x);
break;
case 2: scanf("%d",&i);
if(ListDelete_Sq(T,i,e)) printf("Delete Error!\n"); // 判断i值是否合法，请填空
else printf("The Element %d is Successfully Deleted!\n", e);
break;
case 3: Load_Sq(T);
break;
case 0: return 1;
}
}
}

Answer 1

书本上的是伪码，另外，c语言是不支持ListDelete_Sq(SqList &L,int i, int &e)这样的操作的，应该传入指针，ListDelete_Sq(SqList *L,int i, int *e)。
我改了下代码。
#include<stdio.h>
#include<malloc.h>
#include <stdlib.h>
#define OK 1
#define ERROR 0
#define LIST_INIT_SIZE 100
#define LISTINCREMENT 10
#define ElemType int
#define OVERFLOW -1

typedef struct
{
int *elem;
int length;
int listsize;
}SqList;

int InitList_Sq(SqList *L)
{
L->elem=(ElemType * )malloc(LIST_INIT_SIZE*sizeof(ElemType));
if(!L->elem) exit(ERROR);
L->length=0;
L->listsize=LIST_INIT_SIZE;
return OK;
}

int Load_Sq(SqList *L)
{

int i;
if(L->length==0) printf("The List is empty!"); // 请填空
else
{
printf("The List is: ");
for(i=0;i<L->length;i++,L->elem++) printf("%d ",L->elem); // 请填空
}
printf("\n");
return OK;
}

int ListInsert_Sq(SqList *L,int i,int e) //在第i个位置之前插入新的元素e
{
int *newbase,*p,*q;
if((i<1)||(i>L->length+1)) 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;
}

int ListDelete_Sq(SqList *L,int i, int *e) //删除第i个元素，并用e返回其值
{
int *p,*q;
if((i<1)||(i>L->length)) return ERROR;
p=&(L->elem[i-1]);
*e=*p;
q=L->elem+L->length-1;
for(++p;p<=q;++p) *(p-1)=*p;
--L->length;
return OK;
}

int main()
{
SqList T;
int a, i;
ElemType e, x;
if(InitList_Sq(&T)==OK) // 判断顺序表是否创建成功
{
printf("A Sequence List Has Created.\n");
}
while(1)
{
printf("1:Insert element\n2:Delete element\n3:Load all elements\n0:Exit\nPlease choose:\n");
scanf("%d",&a);
switch(a)
{
case 1: scanf("%d%d",&i,&x);
if(ListInsert_Sq(&T,i,e)!=OK) printf("Insert Error!\n"); // 判断i值是否合法，请填空
else printf("The Element %d is Successfully Inserted!\n", x);
break;
case 2: scanf("%d",&i);
if(ListDelete_Sq(&T,i,&e)) printf("Delete Error!\n"); // 判断i值是否合法，请填空
else printf("The Element %d is Successfully Deleted!\n", e);
break;
case 3: Load_Sq(&T);
break;
case 0: return 1;
}
}
}

Answer 2

exit(OVERFLOW); 改成 exit(0);

int ListInsert_Sq(SqList &L,int i,int e) //在第i个位置之前插入新的元素e
{
int *newbase,*q,*p;

int ListDelete_Sq(SqList &L,int i, int &e) //删除第i个元素，并用e返回其值
{
int *q,*p;

Answer 3

//改好了
#include<stdio.h>
#include<malloc.h>
#include <stdlib.h>//exit函数需要这个头文件
#define OK 1
#define ERROR 0
#define LIST_INIT_SIZE 100
#define LISTINCREMENT 10
#define ElemType int
#define OVERFLOW -1//缺少这个宏定义

typedef struct
{
int *elem;
int length;
int listsize;
}SqList;

int InitList_Sq(SqList &L)
{
L.elem=(ElemType * )malloc(LIST_INIT_SIZE*sizeof(ElemType));
if(!L.elem) exit(ERROR);
L.length=0;
L.listsize=LIST_INIT_SIZE;
return OK;
}

int Load_Sq(SqList &L)
{

int i;
if(L.length==0) printf("The List is empty!"); // 请填空
else
{
printf("The List is: ");
for(i=0;i<L.length;i++,L.elem++) printf("%d ",L.elem); // 请填空
}
printf("\n");
return OK;
}

int ListInsert_Sq(SqList &L,int i,int e) //在第i个位置之前插入新的元素e
{
int *newbase,*p,*q;//缺少p
if(i<1||i>L.length+1) 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;
}

int ListDelete_Sq(SqList &L,int i, int &e) //删除第i个元素，并用e返回其值
{
int *p,*q;//缺少p
if((i<1)||(i>L.length)) return ERROR;
p=&(L.elem[i-1]);
e=*p;
q=L.elem+L.length-1;
for(++p;p<=q;++p) *(p-1)=*p;
--L.length;
return OK;
}

int main()
{
SqList T;
int a, i;
ElemType e, x;
if(InitList_Sq(T)==OK) // 判断顺序表是否创建成功
{
printf("A Sequence List Has Created.\n");
}
while(1)
{
printf("1:Insert element\n2:Delete element\n3:Load all elements\n0:Exit\nPlease choose:\n");
scanf("%d",&a);
switch(a)
{
case 1: scanf("%d%d",&i,&x);
if(ListInsert_Sq(T,i,e)!=OK) printf("Insert Error!\n"); // 判断i值是否合法，请填空
else printf("The Element %d is Successfully Inserted!\n", x);
break;
case 2: scanf("%d",&i);
if(ListDelete_Sq(T,i,e)) printf("Delete Error!\n"); // 判断i值是否合法，请填空
else printf("The Element %d is Successfully Deleted!\n", e);
break;
case 3: Load_Sq(T);
break;
case 0: return 1;
}
}
}

Answer 4

我看if(p)来判断是否为空，一个链表总是奇偶交替着吧，一个奇后面就是偶了……所以把第一个链到list1里，第二个链到list2。
首先，while判断p是否为空，不为空，把第1个结点链到list1里，然后p=p->next指针后移。指向下一个结点。然后if判断p是否为空，不为空的话把第2个结点链到list2里，然后p=p->next指针后移。只到p为空结束……