数据结构 用C语言描述 课后答案(4)

{temp=l->elem[i-1];

l->elem[i-1]=l->elem[l->length-i]; l->elem[l->length-i]=temp; } }

main() {

sqlist l;

int choice=1,elem,position; initlist_sq(&l); listprintf_sq(&l); while(choice!=0) {

choice=1;

printf(\ scanf(\ switch(choice) {

case 1:{printf(\ scanf(\

printf(\ scanf(\

listinsert_sq(&l,position,elem); listprint_sq(&l); break; }

case 2:{printf(\ scanf(\

listdelete_sq(&l,position,&elem); listprint_sq(&l); break; }

case 3:{reverselist(&l); listprint_sq(&l); break; }

case 0:printf(\ }

}

getch(); }

十四、单链表基本操作实现 【解答】

#include \#define null 0

typedef struct lnode {int data;

struct lnode *next; } lnode,*linklist;

void reverselist(linklist l); void listprint_list(linklist l);

int listlength(linklist l) { int i;

linklist p; p=l; i=0;

while (p->next) {p=p->next; i++; }

return(i); }

void reverselist(linklist l) {

linklist p,q; if (l->next) {p=l->next; l->next=null; while(p) {q=q->next;

p->next=l->next; l->next=p; p=q; }

} else

printf(\}

void initlist_link(linklist *l) {

int i,j,e; linklist s,p;

*l=(linklist)malloc(sizeof(lnode)); (*l)->next=null;

printf(\ scanf(\

for (j=1,p=*l;j<=i;j++)

{printf(\ scanf(\

s=(linklist)malloc(sizeof(lnode)); s->data=e;

s->next=p->next; p->next=s; p=s; }

printf(\}

void listinsert_link(linklist l,int i,int e) {

linklist p,s; int j; p=l;j=0;

while(p&&jnext;j++;}

if (!p||j>i-1) printf(\ else

{s=(linklist)malloc(sizeof(lnode)); s->data=e;

s->next=p->next; p->next=s; } }

void listdelete_link(linklist l,int i,int *e) {

linklist p,q; int j; p=l;j=0;

while(p->next&&jnext;j++;}

if (!(p->next)||j>i-1) printf(\ else

{q=p->next;

p->next=p->next->next; *e=p->data; free(q); } }

void listprint_link(linklist l) {

linklist p; p=l->next;

printf(\

while(p) {printf(\ printf(\}

main() {

int choice,position,elem; linklist head;

initlist_link(&head); listprint_link(head); choice=1;

while(choice!=0)

{printf(\ scanf(\ switch(choice)

{case 1:{printf(\ scanf(\

printf(\ scanf(\

listinsert_link(head,position,elem);

listprint_link(head); break; }

case 2:{printf(\ scanf(\

listdelete_link(head,position,&elem); listprint_link(head); break; }

case 3:{reverselist(head);listprint_link(head);break;}

case 4:{printf(\ case 0:{printf(\ } }

getch(); }