数据结构之链表（C语言）

HACKHT 2007-09-26 09:49:34

#include<stdio.h>
#include<malloc.h>
typedef struct node{
int data;
struct node *next;
}NODE;

void *InitList(NODE *L){
L=(NODE *)malloc(sizeof(NODE));
L->next=NULL;
return 0;
}

void *creat(NODE *L){
int m,i; NODE *q,*p ;
printf("qing shu ru shu mu:");
scanf("%d",&m);
printf("qing shu ru shu zi:");
q=(NODE *)malloc(sizeof(NODE));
q=L;
for(i=0;i<m;i++){
p=(NODE *)malloc(sizeof(NODE));
scanf("%d",&p->data);
p->next=NULL;
q->next=p;
q=p;}
printf("wan cheng\n");
return 0;
}

void *ListInsert(NODE *L){
int i,e,j; NODE *p,*s;
printf("Now you will push a number into the list !\n");
printf("Where do you want to push the number,pleast input the xuhao:");
scanf("%d",&i);
printf("Now the number will push before %d! \n",i);
printf("Please input your number:");
scanf("%d",&e); printf("\n");
p=L; j=0;
while(p!=NULL&&j<i-1){
p=p->next; ++j;}
if(p==NULL||j>i-1) return 0;
s=(NODE *)malloc(sizeof(NODE));
s->data=e; s->next=p->next;
p->next=s;
printf("The %d have been push into the list! \n",e);
return 0;
}

void *ListDel(NODE *L){
int i,j; NODE *p,*q;
printf("Now you will delete a number from the list! \n");
printf("Please input the number's xuhao :");
scanf("%d",&i); printf("\n");
p=L; j=0;
while(p->next!=NULL&&j<i-1){
p=p->next; ++j;}
if(p->next==NULL||j>i-1) return 0;
q=p->next; p->next=q->next;
printf("The %d is delete successfully!\n",q->data);
free(q);
return 0;
}

void PrintList(NODE *L){
NODE *p;
p=(NODE *)malloc(sizeof(NODE));
p=L->next;
while(p!=NULL){
printf("%5d",p->data);
p=p->next;}

}

void main(){
NODE *T; int n=0;
printf("1.InitList 2.ListInsert 3.ListDel 4.PrintfList 5.Exit \n");
while(n!=5){
printf("Please choose the gongneng:");
scanf("%d",&n);
switch(n){
case 1:
InitList(T);
creat(T);printf("\n");
break;
case 2:
ListInsert(T);
break;
case 3:
ListDel(T);
break;
case 4:
PrintList(T); printf("\n");
break;
case 5:
break;}
}
}

...全文